Quantum Computers and Dissipation
G. Massimo Palma, Kalle-Antti Suominen, Artur K. Ekert
Abstract
We analyse dissipation in quantum computation and its destructive impact on efficiency of quantum algorithms. Using a general model of decoherence, we study the time evolution of a quantum register of arbitrary length coupled with an environment of arbitrary coherence length. We discuss relations between decoherence and computational complexity and show that the quantum factorization algorithm must be modified in order to be regarded as efficient and realistic.
Create a lesson
Related papers
Parallel quantum channel discrimination and numerical ranges in tensor product subspaces
Adam Bílek, Paulina Lewandowska, Ryszard Kukulski
Asymptotically Good Quantum Locally Testable Codes
William Gay, Fernando Granha Jeronimo
All causally separable quantum processes are quantum circuits with classical control of causal order
Julian Wechs, Alastair A. Abbott, Cyril Branciard
Analytic leakage suppression with a single control field: fast two-qubit gates with tunable couplers
Lukas Heunisch, Michael J. Hartmann, Aashish A. Clerk
Procrastinating einselection in non-Markovian quantum dynamics
Michael J. Moody, Tara Kalsi, Agung Budiyono et al.
Quantum Entropy Contraction and Factorization from Hypercontractivity
Li Gao, Lijun Wang