English
Related papers

Related papers: An Enhanced Photonic Quantum Finite Automaton

200 papers

We propose a new scheme for measuring the quantum efficiency of photon counting detectors by using correlated pho-tons. The measurement technique is based on a 90 rotation of the polarization of one photon member of a correlated pair…

Quantum imaging is an advanced method for microscopy or investigating the optical properties of materials or bio-medical inspections with high accuracy, low noise, and extremely low photo-damage. In previous work, we proposed a quantum…

Optics · Physics 2025-05-09 Mousume Samad , Maki Shimizu , Yasuto Hijikata

We show that one-way quantum one-counter automaton with zero-error is more powerful than its probabilistic counterpart on promise problems. Then, we obtain a similar separation result between Las Vegas one-way probabilistic one-counter…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Masaki Nakanishi , Abuzer Yakaryılmaz , Aida Gainutdinova

Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular interest is the 2-way model of Ambainis and Watrous that has both quantum and classical states (2QCFA) [A.…

Quantum Physics · Physics 2007-05-23 M. V. Panduranga Rao , V. Vinay

We examine the characteristic features of reversible and quantum computations in the presence of supplementary external information, known as advice. In particular, we present a simple, algebraic characterization of languages recognized by…

Quantum Physics · Physics 2015-08-25 Tomoyuki Yamakami

We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's). For this…

Computational Complexity · Computer Science 2014-01-29 Abuzer Yakaryilmaz , A. C. Cem Say

Adaptive measurements were recently shown to significantly improve the performance of quantum state tomography. Utilizing information about the system for the on-line choice of optimal measurements allows to reach the ultimate bounds of…

In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that are at least as general as Kondacs-Watrous QFA's are equivalent in power to classical probabilistic finite…

Computational Complexity · Computer Science 2010-09-20 Abuzer Yakaryilmaz , A. C. Cem Say

Polarized light microscopy using path-entangled $N$-photon states (i.e., the N00N states) has been demonstrated to surpass the shot-noise limit at very low light illumination. However, the microscopy images suffer from divergence of phase…

Quantum Physics · Physics 2017-01-27 G. R. Jin , W. Yang , C. P. Sun

The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model has been shown to be strictly superior in terms of language recognition power to its probabilistic counterpart.…

Computational Complexity · Computer Science 2014-01-29 Abuzer Yakaryilmaz , A. C. Cem Say

In this letter, we propose a method of dark count correction in quantum state tomography of entangled photon pairs. The framework is based on a linear model of dark counts, which is imposed on the measurement formalism. The method is tested…

Quantum Physics · Physics 2022-09-21 Artur Czerwinski

In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…

Formal Languages and Automata Theory · Computer Science 2016-07-20 Benedikt Bollig

Probabilistic amplification through photon addition, at the output of an Mach-Zehnder interferometer is discussed for a coherent input state. When a metric of signal to noise ratio is considered, nondeterministic, noiseless amplification of…

Bosonic quantum error correcting codes are primarily designed to protect against single-photon loss. To correct for this type of error, one can encode the logical qubit in code spaces with a definite photon parity, such as cat codes or…

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…

Discrete Mathematics · Computer Science 2015-03-18 Jean-Marc Fédou , Gabriele Fici

We propose novel coherent-state phase concentration by probabilistic measurement-induced ampli- fication. The amplification scheme uses novel architecture, thermal noise addition (instead of single photon addition) followed by feasible…

Quantum Physics · Physics 2015-05-13 Petr Marek , Radim Filip

We formulate minimum-error and unambiguous discrimination problems for quantum processes in the language of process positive operator valued measures (PPOVM). In this framework we present the known solution for minimum-error discrimination…

Quantum Physics · Physics 2015-05-18 Mario Ziman , Michal Sedlák

We discuss the effects of imperfect photon detectors suffering from loss and noise on the reliability of linear optical quantum computers. We show that for a given detector efficiency, there is a maximum achievable success probability, and…

Quantum Physics · Physics 2012-05-18 Scott Glancy , J. M. LoSecco , H. M. Vasconcelos , C. E. Tanner

Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…

Formal Languages and Automata Theory · Computer Science 2010-07-27 Edoardo Carta-Gerardino , Parisa Babaali

We show that weak measurement can be used to "amplify" optical nonlinearities at the single- photon level, such that the effect of one properly post-selected photon on a classical beam may be as large as that of many un-post-selected…

Quantum Physics · Physics 2015-03-17 Amir Feizpour , Xingxing Xing , Aephraim M. Steinberg