Dense quantum coding and quantum finite automata

DOI10.1145/581771.581773MaRDI QIDQ3455539zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani, 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

zbMATH Keywords

automaton sizecommunication complexityencodingfinite automataquantum communicationquantum computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68) Quantum coding (general) (81P70)

Recommendations

• Dense quantum coding and a lower bound for 1-way quantum automata
• A quantum analog of Huffman coding
• Optimal Encoding of Classical Information in a Quantum Medium
• Improved constructions of mixed state quantum automata
• Hamming, Permutations and Automata

Cited in

(43)

• On the homogeneous algebraic graphs of large girth and their applications
• Improved constructions of quantum automata
• A note on quantum sequential machines
• A probabilistic model of computing with words
• Quantum versus deterministic counter automata
• On the security of semi-device-independent QKD protocols
• The randomness in 2 1 quantum random access code without a shared reference frame
• Semi-device-independent randomness certification with partially free random sources using 4 1 quantum random access code
• The geometry of Bloch space in the context of quantum random access codes
• Entropy accumulation
• On hybrid models of quantum finite automata
• Polynomial time quantum computation with advice
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Dense quantum coding and a lower bound for 1-way quantum automata
• From quantum query complexity to state complexity
• Potential of quantum finite automata with exact acceptance
• On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
• One-way finite automata with quantum and classical states
• Separable states improve protocols with finite randomness
• The learnability of quantum states
• Hamming, Permutations and Automata
• PRIVATE DATABASE QUERIES USING QUANTUM STATES WITH LIMITED COHERENCE TIMES
• State succinctness of two-way finite automata with quantum and classical states
• A quantum analog of Huffman coding
• Time-Space Complexity Advantages for Quantum Computing
• Unbounded-Error Classical and Quantum Communication Complexity
• Two-tape finite automata with quantum and classical states
• Quantum state complexity of formal languages
• Improved Constructions of Quantum Automata
• Online learning of quantum states
• Optimal bounds for parity-oblivious random access codes
• Frame Potential in CPⁿ 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
• Two instances of random access code in the quantum regime
• A review of quantum correlation sharing: the recycling of quantum correlations triggered by quantum measurements
• Parity oblivious d-level random access codes and class of noncontextuality inequalities
• Classical bounds on two-outcome bipartite Bell expressions and linear prepare-and-measure witnesses: Efficient computation in parallel environments such as graphics processing units
• Characterizations of one-way general quantum finite automata
• Quantum information and the PCP theorem
• Quantum inductive inference by finite automata
• Quantum cryptography

This page was built for publication: Dense quantum coding and quantum finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455539)