Excluding false negative error in certification of quantum channels
- URL: http://arxiv.org/abs/2106.02375v3
- Date: Mon, 25 Apr 2022 11:38:12 GMT
- Title: Excluding false negative error in certification of quantum channels
- Authors: Aleksandra Krawiec, {\L}ukasz Pawela, Zbigniew Pucha{\l}a
- Abstract summary: This work focuses on the scenario when the false negative error cannot occur, even if it leads to the growth of the probability of false positive error.
We establish a condition when it is possible to exclude false negative error after a finite number of queries to the quantum channel in parallel.
- Score: 68.8204255655161
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Certification of quantum channels is based on quantum hypothesis testing and
involves also preparation of an input state and choosing the final measurement.
This work primarily focuses on the scenario when the false negative error
cannot occur, even if it leads to the growth of the probability of false
positive error. We establish a condition when it is possible to exclude false
negative error after a finite number of queries to the quantum channel in
parallel, and we provide an upper bound on the number of queries. On top of
that, we found a class of channels which allow for excluding false negative
error after a finite number of queries in parallel, but cannot be distinguished
unambiguously. Moreover, it will be proved that parallel certification scheme
is always sufficient, however the number of steps may be decreased by the use
of adaptive scheme. Finally, we consider examples of certification of various
classes of quantum channels and measurements.
Related papers
- Quantum Non-Demolition Measurements and Leggett-Garg inequality [0.0]
Quantum non-demolition measurements define a non-invasive protocol to extract information from a quantum system.
This protocol leads to a quasi-probability distribution for the measured observable outcomes, which can be negative.
We show that there are situations in which Leggett-Garg inequalities are satisfied even if the macrorealism condition is violated.
arXiv Detail & Related papers (2024-07-31T18:04:51Z) - 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) - Scalable evaluation of incoherent infidelity in quantum devices [0.0]
We introduce the incoherent infidelity as a measure of incoherent errors.
This method is applicable to generic quantum evolutions subjected to time-dependent Markovian noise.
It provides an error quantifier for the target circuit, rather than an error averaged over many circuits or quantum gates.
arXiv Detail & Related papers (2023-05-30T19:03:42Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Certification of incompatible measurements using quantum steering [0.0]
We consider the problem of certification of quantum measurements with an arbitrary number of outcomes.
We propose a simple scheme for certifying any set of $d$-outcome projective measurements which do not share any common invariant proper subspace.
arXiv Detail & Related papers (2021-07-01T13:04:47Z) - Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier [73.70426431502803]
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model.
This yields the first post-quantum succinct argument system from any falsifiable assumption.
arXiv Detail & Related papers (2021-03-15T05:09:17Z) - Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs.
Coded Systems [69.33243249411113]
We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels.
We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
arXiv Detail & Related papers (2020-12-15T15:51:27Z) - Ultimate limits for multiple quantum channel discrimination [0.966840768820136]
This paper studies the problem of hypothesis testing with quantum channels.
We establish a lower limit for the ultimate error probability affecting the discrimination of an arbitrary number of quantum channels.
We also show that this lower bound is achievable when the channels have certain symmetries.
arXiv Detail & Related papers (2020-07-29T03:08:48Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Beyond single-shot fault-tolerant quantum error correction [0.7734726150561088]
We show that fault-tolerant quantum error correction can be achieved using $O(d log(d))$ measurements for any code.
We prove the existence of a sub-single-shot fault-tolerant quantum error correction scheme using fewer than r measurements.
arXiv Detail & Related papers (2020-02-12T19:04:36Z)
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.