相关论文: Approximation Errors
Most quantum error correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $\ket{0}$, which can be used as ancilla qubits to prepare multi-qubit logical states. In this report, we examine the…
Using error correcting codes and fault tolerant techniques, it is possible, at least in theory, to produce logical qubits with significantly lower error rates than the underlying physical qubits. Suppose, however, that the gates that act on…
This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model, a probabilistic bound is derived for the forward error of…
An important class of physical systems that are of interest in practice are input-output open quantum systems that can be described by quantum stochastic differential equations and defined on an infinite-dimensional underlying Hilbert…
Using lie algebra, this brief text provides an upper bound on the universality of QAOA. That is, we prove that the upper bound for the number of alterations of QAOA required to approximate a universal gate set is within O(n)
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
Error-correction process has to be carried out periodically to prevent accumulation of errors in fault-tolerant quantum computation. It is believed that the best choice to get maximum threshold value is carrying out an error-correction…
The ability to execute high-fidelity operations is crucial to scaling up quantum devices to large numbers of qubits. However, signal distortions originating from non-linear components in the control lines can limit the performance of…
Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…
We discuss the implementation of lattice gauge theories on digital quantum computers, focusing primarily on the number of quantum gates required to simulate their time evolution. We find that to compile quantum circuits, using available…
We propose a method for applying the quantum error-correction method for errors that occur during quantum gates. Using a perturbation treatment of the noise that allows us to separate it from the ideal evolution of the quantum gate, we…
In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties.…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
Fault tolerant protocol assumes the application of error correction after every quantum gate. However, correcting errors is costly in terms of time and number of qubits. Here we demonstrate that quantum error correction can be applied…
In this paper we propose a wide class of truncated stochastic approximation procedures with moving random bounds. While we believe that the proposed class of procedures will find its way to a wider range of applications, the main motivation…
The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis…
This is an investigation of the limits of quantum circuit simulation with Schrodinger's formulation and low precision arithmetic. The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…
In many instances of fixed-point multiplication, a full precision result is not required. Instead it is sufficient to return a faithfully rounded result. Faithful rounding permits the machine representable number either immediately above or…