Quantum computation and quantum information†
DOI10.1080/17445760500355678zbMath1084.68050OpenAlexW2046441464MaRDI QIDQ3375535
Publication date: 14 March 2006
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/17445760500355678
complexityalgorithmscryptographyquantum mechanicsexperimentssuperpositioninformation theoryinterferenceentanglementmeasurementerror-correctionquantum gatesqubitquantum computer
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The development of the number field sieve
- Explorations in quantum computing
- Conservative logic
- Riemann's hypothesis and tests for primality
- Exploiting the deep structure of constraint problems
- The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
- One complexity theorist's view of quantum computing
- Linking classical and quantum key agreement: Is there a classical analog to bound entanglement?
- Oblivious transfer and privacy amplification
- Secure communications over insecure channels
- Quantum computational networks
- Quantum Computation
- Universal Quantum Simulators
- Multiple-particle interference and quantum error correction
- Privacy Amplification by Public Discussion
- New directions in cryptography
- Characterizing classes of functions computable by quantum parallelism
- Rapid solution of problems by quantum computation
- A method for obtaining digital signatures and public-key cryptosystems
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum algorithms revisited
- Reliable quantum computers
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- The capacity of the quantum channel with general signal states
- Oracle Quantum Computing
- Quantum cryptography based on Bell’s theorem
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Demonstration of a Fundamental Quantum Logic Gate
- Measurement of Conditional Phase Shifts for Quantum Logic
- Error Correcting Codes in Quantum Theory
- Capacities of Quantum Erasure Channels
- Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels
- Bell’s theorem without inequalities
- Universality in quantum computation
- A universal two-bit gate for quantum computation
- Experimental quantum teleportation
- A single quantum cannot be cloned
- Mixed-state entanglement and quantum error correction
- Unconventional Computation
- Logical Reversibility of Computation
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Can Quantum-Mechanical Description of Physical Reality be Considered Complete?
- Quantum optimization
This page was built for publication: Quantum computation and quantum information†