Algebraic Methods in Quantum Informatics

DOI10.1007/978-3-540-75414-5_6zbMath1149.68026OpenAlexW1541795529MaRDI QIDQ3522861

Jozef Gruska

Publication date: 4 September 2008

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_6

Mathematics Subject Classification ID

Related Items (1)

Quantum Complexity of Boolean Matrix Multiplication and Related Problems

Cites Work

• Implausible consequences of superstrong nonlocality
• Characterizing quantum theory in terms of information-theoretic constraints
• The physics of no-bit-Commitment: Generalized quantum non-locality versus oblivious transfer
• Extending stochastic and quantum functions
• Two-way finite automata with quantum and classical states.
• Quantum entanglement as a new information processing resource
• The quantum query complexity of the hidden subgroup problem is polynomial
• Recent advances in formal languages and applications.
• Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
• Quantum finite automata with control language
• Optimal measurements for the dihedral hidden subgroup problem
• Bell Inequalities: Many Questions, a Few Answers
• Simulating Quantum Computation by Contracting Tensor Networks
• Quantum algorithms for solvable groups
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Limitations of quantum coset states for graph isomorphism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic Methods in Quantum Informatics