Corpus ID: 202542399

Markov chains for error accumulation in quantum circuits

@article{Ma2019MarkovCF,
  title={Markov chains for error accumulation in quantum circuits},
  author={Long Ma and J. Sanders},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • Long Ma, J. Sanders
  • Published 2019
  • Physics, Mathematics, Computer Science
  • arXiv: Quantum Physics
We study a model for the accumulation of errors in multi-qubit quantum computations, as well as a model describing continuous errors accumulating in a single qubit. By modeling the error process in a quantum computation using two coupled Markov chains, we are able to capture a weak form of time-dependency between errors in the past and future. By subsequently using techniques from the field of discrete probability theory, we calculate the probability that error measures such as the fidelity and… Expand

References

SHOWING 1-10 OF 58 REFERENCES
Modeling coherent errors in quantum error correction
Analysis of quantum error correcting codes is typically done using a stochastic, Pauli channel error model for describing the noise on physical qubits. However, it was recently found that coherentExpand
Performance of quantum error correction with coherent errors
We compare the performance of quantum error correcting codes when memory errors are unitary with the more familiar case of dephasing noise. For a wide range of codes we analytically compute theExpand
Quantum optimization using variational algorithms on near-term quantum devices
TLDR
The quantum volume as a metric to compare the power of near-term quantum devices is discussed and simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Expand
Repeated quantum error correction on a continuously encoded qubit by real-time feedback
TLDR
The actively error-corrected qubit is robust against errors and encoded quantum superposition states are preserved beyond the natural dephasing time of the best physical qubit in the encoding. Expand
Approximate randomized benchmarking for finite groups
We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the averageExpand
Correcting coherent errors with surface codes
TLDR
By performing large-scale simulations, Robert König from Technical University of Munich and an international team of collaborators show that coherent effects do not significantly impact the error correction in surface codes, giving confidence in the viability of this approach for developing fault-tolerance quantum computing architectures. Expand
Randomized Benchmarking, Correlated Noise, and Ising Models
TLDR
The expected randomized benchmarking sequence fidelity for a system subject to Gaussian time-correlated noise is computed and it is shown that the expected sequence fidelity is given by the partition function of a long-range coupled spin-one Ising model. Expand
Quantum computing with realistically noisy devices
  • E. Knill
  • Computer Science, Medicine
  • Nature
  • 2005
TLDR
This work reports a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent, and shows that non-trivial quantum computations at EPG’s of as low as one per cent could be implemented. Expand
Robust Characterization of Loss Rates.
TLDR
A scalable and platform-independent protocol for estimating the average loss rate resulting from an arbitrary Markovian noise process, as well as an independent estimate of detector efficiency and a new indicator for non-Markovian signatures in the experimental data. Expand
Fault-tolerant quantum error detection
TLDR
This work shows the encoding and syndrome measurement of a fault-tolerantly prepared logical qubit via an error detection protocol on four physical qubits, represented by trapped atomic ions, demonstrating the robustness of a logical qu bit to imperfections in the very operations used to encode it. Expand
...
1
2
3
4
5
...