{"arxiv_id":"quant-ph/9611025","incoming":{"papers":35,"sentences":45,"groups":[{"kind":"method_or_tool","label":"Uses its method or tool","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2012.14523","title":"Monte Carlo Quantum Computing","url":"/paper/2012.14523","section":"Universal Quantum Circuits Using Bi-Fermion Rebits","sentence":"The second strategy takes advantage of the well developed methods of quantum error correction, either employing techniques known as subsystem-, operator-, or Hamiltonian-encoding [ref] that suppress qubit errors using energy penalties, or more fundamentally and systematically, building the Feynman-Kitaev construct from a quantum circuit ${U_L(t)}_t=1^T$ that has quantum error correction and fault tolerance via concatenated encoding [ref] built in as being explained previously in this section.","intent_p":0.87,"contests_p":null}]},{"kind":"comparison","label":"Compares with it","papers":3,"sentences":3,"quotes":[{"arxiv_id":"2104.03141","title":"Quantum Corralling","url":"/paper/2104.03141","section":"Disorder","sentence":"Also, the present efficiency is compatible with other state of the art protocols [ref] and we believe we can increase its efficiency at higher error rates by properly applying quantum error correction strategies at intermediate corrals [ref] .","intent_p":0.92,"contests_p":null},{"arxiv_id":"1701.03359","title":"Constructing optimal quantum error correcting codes from absolute maximally entangled states","url":"/paper/1701.03359","section":"Quantum error correcting codes from AME states","sentence":"The first was presented in [ref] and later used in [ref] .","intent_p":0.98,"contests_p":null},{"arxiv_id":"1703.00032","title":"Noise-resilient preparation of quantum many-body ground states","url":"/paper/1703.00032","section":"Introduction","sentence":"The analysis, by definition, has to be completely different from the error analysis in fault tolerant quantum computation, wherein the effect of noise is bounded by counting and weighting different fault paths [ref] .","intent_p":0.91,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites it as support","papers":1,"sentences":1,"quotes":[{"arxiv_id":"0904.2557","title":"An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation","url":"/paper/0904.2557","section":"The need for fault tolerance","sentence":"Now we know that, provided that the physical error rate per gate and per time step is below some constant threshold value, it is possible to make the logical quantum computation we wish to perform arbitrarily close to correct with overhead that is polylogarithmic in the length of the computation [ref] .","intent_p":0.98,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":13,"sentences":14,"quotes":[{"arxiv_id":"0806.0383","title":"Fault-Tolerant Computing With Biased-Noise Superconducting Qubits","url":"/paper/0806.0383","section":"Introduction","sentence":"On the basis of fundamental early theoretical work [ref] , lip service is frequently paid to a necessary universal set of operations containing the two-qubit controlled-$σ_x$ (cnot) gate, and a necessary “threshold” error rate in the $10^-5-10^-4$ range.","intent_p":0.97,"contests_p":null},{"arxiv_id":"2104.09539","title":"Practical quantum error correction with the XZZX code and Kerr-cat qubits","url":"/paper/2104.09539","section":"Introduction","sentence":"While we cannot expect to reduce qubit noise arbitrarily with laboratory engineering alone, the theory of quantum error correction [ref] has shown that we can produce logical qubits that experience next-to-no noise by using a redundancy of high-quality physical qubits, provided the noise strength on the physical qubits as they perform computational operations is below some threshold value [ref] .","intent_p":0.81,"contests_p":null},{"arxiv_id":"2605.12385","title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","url":"/paper/2605.12385","section":"Local measurements on a 1-D chain","sentence":"Quantum error-correcting codes [ref] used fault-tolerantly can perform arbitrarily accurate computations with noisy components, provided the noise stays below a threshold as the system size is scaled up [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"1610.03507","title":"Quantum fault tolerance in small experiments","url":"/paper/1610.03507","section":"Introduction","sentence":"More sophisticated protocols are possible which have a threshold error rate [ref] , and the circuit is protected provided the error rate per gate or time step is below the threshold value.] In addition, fault-tolerant protocols offer the possibility of safely performing gates on the encoded states rather than just storing quantum information.","intent_p":0.87,"contests_p":null},{"arxiv_id":"2009.07161","title":"Fault-tolerant Coding for Quantum Communication","url":"/paper/2009.07161","section":"Concatenated quantum error correcting codes and the threshold theorem","sentence":"A major result on fault-tolerant implementations of quantum circuits using quantum error correcting codes is the threshold theorem by Aharonov and Ben-Or [ref] .","intent_p":0.99,"contests_p":null}]}],"unlabelled_sentences":26},"outgoing":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":null,"_links":{"html":"https://pith.science/paper/quant-ph/9611025"}}