Physical quantum algorithms
From MaRDI portal
Publication:1613778
DOI10.1016/S0010-4655(02)00420-4zbMath0998.81010MaRDI QIDQ1613778
Publication date: 2 September 2002
Published in: Computer Physics Communications (Search for Journal in Brave)
81P68: Quantum computation
81V80: Quantum optics
81-08: Computational methods for problems pertaining to quantum theory
Related Items
Quantum Simulations of Physics Problems, Complete sets of initial vectors for pattern growth with elementary cellular automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- From quantum cellular automata to quantum lattice gases
- Simulating quantum mechanics on a quantum computer.
- Poly-locality in quantum computing
- Parrondo games as lattice gas automata
- Simulation of topological field theories by quantum computers
- Universal Quantum Simulators
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Simulating quantum systems on a quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Finite Precision Measurement Nullifies the Kochen-Specker Theorem
- Global entanglement in multiparticle systems
- On the Problem of Hidden Variables in Quantum Mechanics
- On Computable Numbers, with an Application to the Entscheidungsproblem
