Certifying coherence in quantum devices under classical control

• URL: http://arxiv.org/abs/2606.03699v1
• Date: Tue, 02 Jun 2026 14:20:45 GMT
• Title: Certifying coherence in quantum devices under classical control
• Abstract summary: We prove that coherence can be fully characterised through a hierarchy of semidefinite programs.<n>For the important special case of qubits, we exploit conceptual connections with the theory of joint measurability.<n>We apply these methods to determine whether quantum channels are able to preserve coherence or are inherently coherence-breaking.
• Score: 33.72751145910978
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum states that do not commute exhibit coherence, but only when the device preparing them is assumed to be unaffected by classical parameters inaccessible to the experimenter. Such hidden classical control arises both in fundamental tests of quantum phenomena and in quantum information protocols that operate under limited control assumptions. Here, we address the problem of coherence certification by developing complete and practically efficient methods. First, we prove that coherence can be fully characterised through a hierarchy of semidefinite programs. Second, we introduce a practical semidefinite programming approach that achieves useful accuracy while remaining computationally efficient even for preparation devices generating many, potentially high-dimensional, quantum states. For the important special case of qubits, we further exploit conceptual connections with the theory of joint measurability to obtain highly accurate coherence characterisation that scales to more than one thousand qubits. Finally, we apply these methods to determine whether quantum channels are able to preserve coherence or are inherently coherence-breaking. Together, these results provide a powerful toolbox for analysing quantum superposition in the presence of hidden classical control.

Related papers

• Device-independent quantum memory certification in two-point measurement experiments [0.0]
  We present a device-independent approach for certifying black-box quantum memories.<n>We do so by probing quantum systems at two points in time and then confronting the observed temporal correlations against classical causal models.<n>Our method establishes temporal correlations and causal modelling as practical and powerful tool for benchmarking key ingredients of quantum technologies.
  arXiv  Detail & Related papers  (2026-01-20T17:49:54Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Retrieving non-linear features from noisy quantum states [11.289924445850328]
  In this paper, we analyze the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.
  arXiv  Detail & Related papers  (2023-09-20T15:28:18Z)
• Quantification of Entanglement and Coherence with Purity Detection [16.01598003770752]
  Entanglement and coherence are fundamental properties of quantum systems, promising to power near future quantum technologies. Here, we demonstrate quantitative bounds to operationally useful entanglement and coherence. Our research offers an efficient means of verifying large-scale quantum information processing.
  arXiv  Detail & Related papers  (2023-08-14T11:03:40Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Enhancing Quantum Computation via Superposition of Quantum Gates [1.732837834702512]
  We present different protocols, which we denote as "superposed quantum error mitigation" We show that significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. We analyze our approach for gate-based, measurement-based and interferometric-based models.
  arXiv  Detail & Related papers  (2023-04-17T18:01:05Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.