Global estimates of errors in quantum computation by the Feynman-Vernon formalism
Erik Aurell

TL;DR
This paper develops a Feynman-Vernon formalism to estimate errors in quantum computation, showing that total errors scale linearly with qubits and operation time, and applies this to models including the toric code.
Contribution
It introduces a path integral approach to quantify errors in quantum computers, providing a simple method to estimate error scaling without error correction.
Findings
Error scales linearly with number of qubits and operation time.
The formalism applies to models like Kitaev's toric code.
Provides a framework for analyzing environment-induced errors.
Abstract
The operation of a quantum computer is considered as a general quantum operation on a mixed state on many qubits followed by a measurement. The general quantum operation is further represented as a Feynman-Vernon double path integral over the histories of the qubits and of an environment, and afterward tracing out the environment. The qubit histories are taken to be paths on the two-sphere as in Klauder's coherent-state path integralof spin, and the environment is assumed to consist of harmonic oscillators initially in thermal equilibrium, and linearly coupled to to qubit operators . The environment can then be integrated out to give a Feynman-Vernon influence action coupling the forward and backward histories of the qubits. This representation allows to derive in a simple way estimates that the total error of operation of a quantum computer without error correction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
