Analysis of Error Propagation in Quantum Computers
- URL: http://arxiv.org/abs/2209.01699v1
- Date: Sun, 4 Sep 2022 21:45:15 GMT
- Title: Analysis of Error Propagation in Quantum Computers
- Authors: Ziang Yu and Yingzhou Li
- Abstract summary: Most quantum gate errors can be characterized by two error models, namely the probabilistic error model and the Kraus error model.
We prove that for a quantum circuit with either of those two models or a mix of both, the propagation error in terms of Frobenius norm is upper bounded by $2(1 - (1 - r)m)$.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Most quantum gate errors can be characterized by two error models, namely the
probabilistic error model and the Kraus error model. We proved that for a
quantum circuit with either of those two models or a mix of both, the
propagation error in terms of Frobenius norm is upper bounded by $2(1 - (1 -
r)^m)$, where $0 \le r < 1$ is a constant independent of the qubit number and
circuit depth, and $m$ is the number of gates in the circuit. Numerical
experiments of synthetic quantum circuits and quantum Fourier transform
circuits are performed on the simulator of the IBM Vigo quantum computer to
verify our analytical results, which show that our upper bound is tight.
Related papers
- Accurate and precise quantum computation of valence two-neutron systems [0.0]
We introduce a quantum algorithm to accurately and precisely compute the ground state of two-neutron systems.
Our experiments using real quantum devices also show the pivotal role of the circuit layout design, attuned to the connectivity of the qubits.
arXiv Detail & Related papers (2024-04-02T06:54:13Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Normal quantum channels and Markovian correlated two-qubit quantum
errors [77.34726150561087]
We study general normally'' distributed random unitary transformations.
On the one hand, a normal distribution induces a unital quantum channel.
On the other hand, the diffusive random walk defines a unital quantum process.
arXiv Detail & Related papers (2023-07-25T15:33:28Z) - Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era [0.0]
Fault-tolerant quantum computation (FTQC) is essential to implement quantum algorithms in a noise-resilient way.
In FTQC, a quantum circuit is decomposed into universal gates that can be fault-tolerantly implemented.
In this paper, we propose that the Clifford+$T$ decomposition error for a given quantum circuit can be modeled as the depolarizing noise.
arXiv Detail & Related papers (2023-01-10T19:00:01Z) - Quantum Error Correction with Gauge Symmetries [69.02115180674885]
Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors.
We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
arXiv Detail & Related papers (2021-12-09T19:29:34Z) - $i$-QER: An Intelligent Approach towards Quantum Error Reduction [5.055934439032756]
We introduce $i$-QER, a scalable machine learning-based approach to evaluate errors in a quantum circuit.
The $i$-QER predicts possible errors in a given quantum circuit using supervised learning models.
It cuts the large quantum circuit into two smaller sub-circuits using an error-influenced fragmentation strategy.
arXiv Detail & Related papers (2021-10-12T20:45:03Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Sample Complexity of Learning Quantum Circuits [4.329298109272386]
We prove that physical quantum circuits are PAC learnable on a quantum computer via empirical risk minimization.
Our results provide a valuable guide for quantum machine learning in both theory and experiment.
arXiv Detail & Related papers (2021-07-19T18:00:04Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - The limits of quantum circuit simulation with low precision arithmetic [0.0]
The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states.
An arithmetic polar representation of $B$ bits is defined for each quantum amplitude.
A model is developed to quantify the cumulative errors on a circuit of $Q$ qubits and $G$ gates.
arXiv Detail & Related papers (2020-05-27T14:48:31Z) - Quantum Statistical Complexity Measure as a Signalling of Correlation
Transitions [55.41644538483948]
We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions.
We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain.
We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
arXiv Detail & Related papers (2020-02-05T00:45:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.