Dense quantum coding and quantum finite automata
From MaRDI portal
Publication:3455539
DOI10.1145/581771.581773zbMath1326.68133OpenAlexW2116921087WikidataQ62398490 ScholiaQ62398490MaRDI QIDQ3455539
Ashwin Nayak, Umesh V. Vazirani, Amnon Ta-Shma, Andris Ambainis
Publication date: 7 December 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/581771.581773
quantum computationfinite automataquantum communicationcommunication complexityencodingautomaton size
Formal languages and automata (68Q45) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)
Related Items
One-Way Finite Automata with Quantum and Classical States ⋮ Quantum information and the PCP theorem ⋮ Time-Space Complexity Advantages for Quantum Computing ⋮ Polynomial time quantum computation with advice ⋮ From Quantum Query Complexity to State Complexity ⋮ State succinctness of two-way finite automata with quantum and classical states ⋮ Potential of Quantum Finite Automata with Exact Acceptance ⋮ Frame Potential in CPn Some Numerical and Analytical Results ⋮ Advantage of Quantum Theory over Nonclassical Models of Communication ⋮ Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code ⋮ The learnability of quantum states ⋮ Entropy accumulation ⋮ Quantum inductive inference by finite automata ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ One-way reversible and quantum finite automata with advice ⋮ Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ On the security of semi-device-independent QKD protocols ⋮ The randomness in \(2 \rightarrow 1\) quantum random access code without a shared reference frame ⋮ Two-tape finite automata with quantum and classical states ⋮ Quantum cryptography ⋮ A probabilistic model of computing with words ⋮ Quantum versus deterministic counter automata ⋮ Determination of equivalence between quantum sequential machines ⋮ On the homogeneous algebraic graphs of large girth and their applications ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Improved constructions of quantum automata ⋮ Separable states improve protocols with finite randomness ⋮ PRIVATE DATABASE QUERIES USING QUANTUM STATES WITH LIMITED COHERENCE TIMES ⋮ A note on quantum sequential machines ⋮ Characterizations of one-way general quantum finite automata ⋮ Quantum State Complexity of Formal Languages ⋮ Improved Constructions of Quantum Automata ⋮ Online learning of quantum states ⋮ Optimal bounds for parity-oblivious random access codes ⋮ Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code ⋮ The geometry of Bloch space in the context of quantum random access codes ⋮ On hybrid models of quantum finite automata
