Dynamical description of quantum computing: Generic nonlocality of quantum noise
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
We develop a dynamical non-Markovian description of quantum computing in the weak-coupling limit, in the lowest-order approximation. We show that the long-range memory of the quantum reservoir (such as the ${1/t}^{4}$ one exhibited by electromagnetic vacuum) produces a strong interrelation between the structure of noise and the quantum algorithm, implying nonlocal attacks of noise. This shows that the implicit assumption of quantum error correction theory---independence of noise and self-dynamics---fails in long time regimes. We also use our approach to present pure decoherence and decoherence accompanied by dissipation in terms of the spectral density of the reservoir. The so-called dynamical decoupling method is discussed in this context. Finally, we propose a minimal decoherence model, in which the only source of decoherence is vacuum. We optimize the fidelity of quantum-information processing under the trade-off between the speed of the gate and the strength of decoherence.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Completely positive dynamical semigroups of N -level systems
Gorini, V., Kossakowski, A., & Sudarshan, E. C. G. (1976) · Journal of Mathematical Physics · doi:10.1063/1.522979 · Cited by 3,998
Dynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808
The emergence of classical properties through interaction with the environment
Joos, E., & Zeh, H. D. (1985) · Zeitschrift für Physik B Condensed Matter · doi:10.1007/bf01725541 · Cited by 1,505
Zanardi, P., & Rasetti, M. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.3306 · Cited by 1,315
Quantum Dynamical Semigroups and Applications
(2007) · Lecture Notes in Physics · doi:10.1007/3-540-70861-8 · Cited by 1,182
Self-citationDavies, E. B. (1974) · Communications in Mathematical Physics · doi:10.1007/bf01608389 · Cited by 934
Cited by
Dynamics of non-Markovian open quantum systems
de Vega, I., & Alonso, D. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015001 · Cited by 1,234
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Overhead and noise threshold of fault-tolerant quantum error correction
Steane, A. M. (2003) · Physical Review A · doi:10.1103/physreva.68.042322 · Cited by 372
Zoller, P., Beth, T., Binosi, D., Blatt, R., Briegel, H., Bruss, D., Calarco, T., Cirac, J. I., Deutsch, D., Eisert, J., et al. (2005) · The European Physical Journal D · doi:10.1140/epjd/e2005-00251-1 · Cited by 352
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
Self-citationNon-Markovian dynamics of a qubit coupled to an Ising spin bath
Krovi, H., Oreshkov, O., Ryazanov, M., & Lidar, D. A. (2007) · Physical Review A · doi:10.1103/physreva.76.052117 · Cited by 70
Continuous-variable-entanglement dynamics in structured reservoirs
Vasile, R., Olivares, S., Paris, M. G. A., & Maniscalco, S. (2009) · Physical Review A · doi:10.1103/physreva.80.062324 · Cited by 67
Classical simulability, entanglement breaking, and quantum computation thresholds
Virmani, S., Huelga, S. F., & Plenio, M. B. (2005) · Physical Review A · doi:10.1103/physreva.71.042328 · Cited by 51
Metadata
- Authors
- Alicki, R., Horodecki, M., Horodecki, P., & Horodecki, R.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2002-05-28
- Volume
- 65
- Issue
- 6
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2052895306
- Cited by
- 108
- References
- 12
- FWCI
- 9.37
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.