Revisiting the simulation of quantum Turing machines by quantum circuits
From MaRDI portal
Publication:5160678
DOI10.1098/rspa.2018.0767zbMath1472.81279arXiv1808.01701OpenAlexW3105382235WikidataQ91781092 ScholiaQ91781092MaRDI QIDQ5160678
Publication date: 29 October 2021
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.01701
causalityquantum computingquantum circuitsmodels of computationquantum Turing machinestheory of computing
Electromagnetic interaction; quantum electrodynamics (81V10) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (4)
Models in quantum computing: a systematic review ⋮ Distributed Grover's algorithm ⋮ Martin-Löf random quantum states ⋮ Quantum generalizations of the polynomial hierarchy with applications to \(\mathrm{QMA(2)}\)
Cites Work
- Unitarity plus causality implies localizability
- Theory of operator algebras. II
- Local Transition Functions of Quantum Turing Machines
- Practical Approximation of Single-Qubit Unitaries by Single-Qubit Quantum Clifford and T Circuits
- Quantum computational networks
- Rapid solution of problems by quantum computation
- Relations Among Complexity Measures
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Computability
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Quantum complexity theory
- Computational Work and Time on Finite Machines
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Revisiting the simulation of quantum Turing machines by quantum circuits
