An Enhanced Photonic Quantum Finite Automaton

Candeloro, Alessandro; Mereghetti, Carlo; Palano, Beatrice; Cialdi, S.; Paris, Matteo G. A.; Olivares, Stefano

doi:10.3390/app11188768

Cited by 6 publications

(5 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let us now measure the final observable on the final superposition ξ (k). By (7), ξ (k) is e (k mod P)+1 , representing the basis state q k mod P . By definition of Q acc , we have that q k mod P is an accepting state if and only if σ k ∈ L P ⟲ .…”

Section: Isolated Cut Point Lqfas For Unary Regular Languagesmentioning

confidence: 99%

See 1 more Smart Citation

Latvian Quantum Finite State Automata for Unary Languages

Mereghetti,

Palano,

Raucci

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

We design Latvian quantum finite state automata (LQFAs for short) recognizing unary regular languages with isolated cut point 1 2 . From an architectural point of view, we combine two LQFAs recognizing with isolated cut point, respectively, the finite part and the ultimately periodic part of any given unary regular language L. In both modules, we use a component addressed in the literature and here suitably adapted to the unary case, to discriminate strings on the basis of their length. The number of basis states and the isolation around the cut point of the resulting LQFA for L exponentially depends on the size of the minimal deterministic finite state automaton for L.

show abstract

Section: Isolated Cut Point Lqfas For Unary Regular Languagesmentioning

confidence: 99%

“…Quantum finite automata (QFAs for short) represent a theoretical model for a quantum computer with finite memory [3,4]. While we can hardly expect to see a full-featured quantum computer in the near future, small quantum components, modeled by QFAs, seem to be promising from a physical implementation viewpoint (see, e.g., [7,15]).…”

Section: Introductionmentioning

confidence: 99%

Latvian Quantum Finite State Automata for Unary Languages

Mereghetti,

Palano,

Raucci

2023

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…( 9), the full unitary consists of multiple 2×2 blocks, which are now realized by the unitary defined in Eq. (12), leading to…”

Section: Qfa Using Photon Oammentioning

confidence: 99%

Quantum advantage using high-dimensional twisted photons as quantum finite automata

Plachta,

Hiekkamäki,

Yakaryılmaz

et al. 2022

Preprint

View full text Add to dashboard Cite

https://qworld.net Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental implementation of multiqubit QFAs using the orbital angular momentum (OAM) of single photons. We implement different high-dimensional QFAs encoded on a single photon, where multiple qubits operate in parallel without the need for complicated multi-partite operations. Using two to eight OAM quantum states to implement up to four parallel qubits, we show that a high-dimensional QFA is able to detect the prime numbers 5 and 11 while outperforming classical finite automata in terms of the required memory. Our work benefits from the ease of encoding, manipulating, and deciphering multiqubit states encoded in the OAM degree of freedom of single photons, demonstrating the advantages structured photons provide for complex quantum information tasks.Many scientific efforts are focused on controlling quantum systems, e.g., ions, atoms, electrons, photons, and others, that can be used to perform computational tasks more efficiently than classical computers. One of the simplest computational models is the finite automaton [32], which is a fundamental computational device that makes binary decisions (yes or no) using its finite memory (states) after reading a given input once, symbol by symbol. More than two

show abstract

“…In [12,22], a photonic implementation of a 2-state QFA was realized using the polarization degree of freedom of light. However, instead of implementing n consecutive U a operators, which would naturally lead to additional challenges and possible increased errors, a single operator U n a , corresponding to the effective transformation of multiple U a operators, was implemented.…”

Section: Implementations Of Qfas On Real Devicesmentioning

confidence: 99%

Quantum advantage using high-dimensional twisted photons as quantum finite automata

Plachta

Hiekkamäki

Yakaryılmaz

et al. 2022

Quantum

View full text Add to dashboard Cite

Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an experimental implementation of multi-qubit QFAs using the orbital angular momentum (OAM) of single photons. We implement different high-dimensional QFAs encoded on a single photon, where multiple qubits operate in parallel without the need for complicated multi-partite operations. Using two to eight OAM quantum states to implement up to four parallel qubits, we show that a high-dimensional QFA is able to detect the prime numbers 5 and 11 while outperforming classical finite automata in terms of the required memory. Our work benefits from the ease of encoding, manipulating, and deciphering multi-qubit states encoded in the OAM degree of freedom of single photons, demonstrating the advantages structured photons provide for complex quantum information tasks.

show abstract

An Enhanced Photonic Quantum Finite Automaton

Cited by 6 publications

References 30 publications

Latvian Quantum Finite State Automata for Unary Languages

Latvian Quantum Finite State Automata for Unary Languages

Quantum advantage using high-dimensional twisted photons as quantum finite automata

Quantum advantage using high-dimensional twisted photons as quantum finite automata

Contact Info

Product

Resources

About