Experimental quantum error detection.
Ontology highlight
ABSTRACT:
SUBMITTER: Jin XM
PROVIDER: S-EPMC3432865 | biostudies-other | 2012
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The fundamental unit for quantum computing is the qubit, an isolated, controllable two-level system. However, for many proposed quantum computer architectures, especially photonic systems, the qubits can be lost or can leak out of the desired two-level systems, posing a significant obstacle for practical quantum computation. Here, we experimentally demonstrate, both in the quantum circuit model and in the one-way quantum computer model, the smallest nontrivial quantum codes to tackle this problem. In the experiment, we encode single-qubit input states into highly entangled multiparticle code words, and we test their ability to protect encoded quantum information from detected 1-qubit loss error. Our results prove in-principle the feasibility of overcoming the qubit loss error by quantum codes.
| S-EPMC2516277 | biostudies-other
Project description:BackgroundHigh-throughput screening (HTS) is a key part of the drug discovery process during which thousands of chemical compounds are screened and their activity levels measured in order to identify potential drug candidates (i.e., hits). Many technical, procedural or environmental factors can cause systematic measurement error or inequalities in the conditions in which the measurements are taken. Such systematic error has the potential to critically affect the hit selection process. Several error correction methods and software have been developed to address this issue in the context of experimental HTS 1234567. Despite their power to reduce the impact of systematic error when applied to error perturbed datasets, those methods also have one disadvantage - they introduce a bias when applied to data not containing any systematic error 6. Hence, we need first to assess the presence of systematic error in a given HTS assay and then carry out systematic error correction method if and only if the presence of systematic error has been confirmed by statistical tests.ResultsWe tested three statistical procedures to assess the presence of systematic error in experimental HTS data, including the ?2 goodness-of-fit test, Student's t-test and Kolmogorov-Smirnov test 8 preceded by the Discrete Fourier Transform (DFT) method 9. We applied these procedures to raw HTS measurements, first, and to estimated hit distribution surfaces, second. The three competing tests were applied to analyse simulated datasets containing different types of systematic error, and to a real HTS dataset. Their accuracy was compared under various error conditions.ConclusionsA successful assessment of the presence of systematic error in experimental HTS assays is possible when the appropriate statistical methodology is used. Namely, the t-test should be carried out by researchers to determine whether systematic error is present in their HTS data prior to applying any error correction method. This important step can significantly improve the quality of selected hits.
| S-EPMC3034671 | biostudies-literature
Project description:Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal quantum error-correcting code, with the subsequent verification of all key features including the identification of an arbitrary physical error, the capability for transversal manipulation of the logical state and state decoding. To address this challenge, we experimentally realise the [5, 1, 3] code, the so-called smallest perfect code that permits corrections of generic single-qubit errors. In the experiment, having optimised the encoding circuit, we employ an array of superconducting qubits to realise the [5, 1, 3] code for several typical logical states including the magic state, an indispensable resource for realising non-Clifford gates. The encoded states are prepared with an average fidelity of [Formula: see text] while with a high fidelity of [Formula: see text] in the code space. Then, the arbitrary single-qubit errors introduced manually are identified by measuring the stabilisers. We further implement logical Pauli operations with a fidelity of [Formula: see text] within the code space. Finally, we realise the decoding circuit and recover the input state with an overall fidelity of [Formula: see text], in total with 92 gates. Our work demonstrates each key aspect of the [5, 1, 3] code and verifies the viability of experimental realisation of quantum error-correcting codes with superconducting qubits.
| S-EPMC8776549 | biostudies-literature
Project description:Quantum communication complexity explores the minimum amount of communication required to achieve certain tasks using quantum states. One representative example is quantum fingerprinting, in which the minimum amount of communication could be exponentially smaller than the classical fingerprinting. Here, we propose a quantum fingerprinting protocol where coherent states and channel multiplexing are used, with simultaneous detection of signals carried by multiple channels. Compared with an existing coherent quantum fingerprinting protocol, our protocol could consistently reduce communication time and the amount of communication by orders of magnitude by increasing the number of channels. Our proposed protocol can even beat the classical limit without using superconducting-nanowire single photon detectors. We also report a proof-of-concept experimental demonstration with six wavelength channels to validate the advantage of our protocol in the amount of communication. The experimental results clearly prove that our protocol not only surpasses the best-known classical protocol, but also remarkably outperforms the existing coherent quantum fingerprinting protocol.
| S-EPMC8298536 | biostudies-literature
Project description:When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover's QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by the Brownian motion of electrons, hence it may have to be mitigated. In this contribution, we investigate the effect of quantum noise on the performance of QSAs, in terms of their success probability as a function of the database size to be searched, when decoherence is modelled by depolarizing channels' deleterious effects imposed on the quantum gates. Moreover, we employ quantum error correction codes for limiting the effects of quantum noise and for correcting quantum flips. More specifically, we demonstrate that, when we search for a single solution in a database having 4096 entries using Grover's QSA at an aggressive depolarizing probability of 10-3, the success probability of the search is 0.22 when no quantum coding is used, which is improved to 0.96 when Steane's quantum error correction code is employed. Finally, apart from Steane's code, the employment of Quantum Bose-Chaudhuri-Hocquenghem (QBCH) codes is also considered.
| S-EPMC5141447 | biostudies-literature
Project description:Heisenberg's uncertainty principle is one of the main tenets of quantum theory. Nevertheless, and despite its fundamental importance for our understanding of quantum foundations, there has been some confusion in its interpretation: Although Heisenberg's first argument was that the measurement of one observable on a quantum state necessarily disturbs another incompatible observable, standard uncertainty relations typically bound the indeterminacy of the outcomes when either one or the other observable is measured. In this paper, we quantify precisely Heisenberg's intuition. Even if two incompatible observables cannot be measured together, one can still approximate their joint measurement, at the price of introducing some errors with respect to the ideal measurement of each of them. We present a tight relation characterizing the optimal tradeoff between the error on one observable vs. the error on the other. As a particular case, our approach allows us to characterize the disturbance of an observable induced by the approximate measurement of another one; we also derive a stronger error-disturbance relation for this scenario.
| S-EPMC3637717 | biostudies-literature
Project description:Fault-tolerant quantum computation with quantum error-correcting codes has been considerably developed over the past decade. However, there are still difficult issues, particularly on the resource requirement. For further improvement of fault-tolerant quantum computation, here we propose a soft-decision decoder for quantum error correction and detection by teleportation. This decoder can achieve almost optimal performance for the depolarizing channel. Applying this decoder to Knill's C4/C6 scheme for fault-tolerant quantum computation, which is one of the best schemes so far and relies heavily on error correction and detection by teleportation, we dramatically improve its performance. This leads to substantial reduction of resources.
| S-EPMC3687222 | biostudies-literature
Project description:Resource overhead problem caused by concatenation in quantum error correction (QEC) is of significant importance for the realization of fault-tolerant quantum computation (FTQC). To attack this problem, we propose a novel scheme by considering integrated FTQC architecture where the concatenation level is controlled dynamically; i.e., less (or more) concatenation levels are imposed by good (or poor) performance gates-we call this scheme "dynamic concatenation" in this sense. Such a dynamic concatenation is realizable in an integrated structure of FTQC, as the information of the concatenation can be communicated between classical system elements (e.g., compiler and system organizer) and the logical qubits in real-time. We derive the effective lower and upper bounds of the length of gate decomposition in order to achieve the practical advantage, namely of reduction of the overall operation time. By considering two non-trivial examples, it is shown that the aforementioned advantage can indeed be achieved in the presented scheme. Our result also provides an important scientific message, i.e., the interplay between "classical" and "quantum" can be helpful in QEC.
| S-EPMC6397214 | biostudies-literature
Project description:Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg limit, which can be achieved for noiseless quantum systems, but is not achievable in general for systems subject to noise. Here we study how measurement precision can be enhanced through quantum error correction, a general method for protecting a quantum system from the damaging effects of noise. We find a necessary and sufficient condition for achieving the Heisenberg limit using quantum probes subject to Markovian noise, assuming that noiseless ancilla systems are available, and that fast, accurate quantum processing can be performed. When the sufficient condition is satisfied, a quantum error-correcting code can be constructed that suppresses the noise without obscuring the signal; the optimal code, achieving the best possible precision, can be found by solving a semidefinite program.
| S-EPMC5758555 | biostudies-literature
Project description:Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, these devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge of exploring the advantage of quantum computation is to minimize the impact of device and control imperfections without complete logical encoding. Quantum error mitigation is a solution satisfying the requirement. Here, we demonstrate an error mitigation protocol based on gate set tomography and quasi-probability decomposition. One- and two-qubit circuits are tested on a superconducting device, and computation errors are successfully suppressed. Because this protocol is universal for digital quantum computers and algorithms computing expected values, our results suggest that error mitigation can be an essential component of near-future quantum computation.
| S-EPMC6731091 | biostudies-literature