The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
arXiv:2212.00553 · doi:10.22331/q-2023-12-12-1206
Abstract
Learning a hidden property of a quantum system typically requires a series of interactions. In this work, we formalise such multi-round learning processes using a generalisation of classical-quantum states, called classical-quantum combs. Here, "classical" refers to a random variable encoding the hidden property to be learnt, and "quantum" refers to the quantum comb describing the behaviour of the system. The optimal strategy for learning the hidden property can be quantified by applying the comb min-entropy (Chiribella and Ebler, NJP, 2016) to classical-quantum combs. To demonstrate the power of this approach, we focus attention on an array of problems derived from measurement-based quantum computation (MBQC) and related applications. Specifically, we describe a known blind quantum computation (BQC) protocol using the combs formalism and thereby leverage the min-entropy to provide a proof of single-shot security for multiple rounds of the protocol, extending the existing result in the literature. Furthermore, we consider a range of operationally motivated examples related to the verification of a partially unknown MBQC device. These examples involve learning the features of the device necessary for its correct use, including learning its internal reference frame for measurement calibration. We also introduce a novel connection between MBQC and quantum causal models that arises in this context.
arXiv comment24 + 17 pages, 11 figures; Modifications to the presentation; some additional results added. Accepted in Quantum 2023-12-01
References in corpus (60)
- Quantum Computing in the NISQ era and beyond
- Quantum cryptography: Public key distribution and coin tossing
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Experimental One-Way Quantum Computing
- Measurement-based quantum computation
- Multi-party entanglement in graph states
- Reference frames, superselection rules, and quantum information
- Satellite-relayed intercontinental quantum network
- Stabilizer Codes and Quantum Error Correction
- Quantum correlations with no causal order
- The European Quantum Technologies Roadmap
- The operational meaning of min- and max-entropy
- Topological fault-tolerance in cluster state quantum computation
- Provably Secure and Practical Quantum Key Distribution over 307 km of Optical Fibre
- Deterministic delivery of remote entanglement on a quantum network
- Theoretical framework for quantum networks
- Quantum Internet: Networking Challenges in Distributed Quantum Computing
- From Classical to Quantum Shannon Theory
- Quantum measurements and the Abelian Stabilizer Problem
- Universal blind quantum computation
- Quantum Circuits Architecture
- Security in Quantum Cryptography
- The lesson of causal discovery algorithms for quantum correlations: Causal explanations of Bell-inequality violations require fine-tuning
- Non-Markovian quantum processes: complete framework and efficient characterisation
- Graphical description of the action of local Clifford transformations on graph states
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- A Fully Quantum Asymptotic Equipartition Property
- Novel schemes for measurement-based quantum computation
- Quantum causal modelling
- Quantum network nodes based on diamond qubits with an efficient nanophotonic interface
- Efficient Distributed Quantum Computing
- Quantum common causes and quantum causal models
- Blind quantum computation protocol in which Alice only makes measurements
- Inferring causal structure: a quantum advantage
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Toward a general theory of quantum games
- An introduction to measurement based quantum computation
- Experimental Realization of Deutsch's Algorithm in a One-way Quantum Computer
- When is a non-Markovian quantum process classical?
- An introduction to operational quantum dynamics
- Optimal quantum networks and one-shot entropies
- Cyclic Quantum Causal Models
- Quantum speedup in the identification of cause-effect relations
- Local unitary versus local Clifford equivalence of stabilizer and graph states
- Finding Optimal Flows Efficiently
- Causal Boxes: Quantum Information-Processing Systems Closed under Composition
- Causality re-established
- Which graph states are useful for quantum information processing?
- Finding flows in the one-way measurement model
- Causal structure in the presence of sectorial constraints, with application to the quantum switch
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Causal and compositional structure of unitary transformations
- Entanglement in Graph States and its Applications
- Two-qubit causal structures and the geometry of positive qubit-maps
- Discrimination Between Quantum Common Causes and Quantum Causality
- Quantum Network Discrimination
- Computational model underlying the one-way quantum computer
- On the Role of Quantum Communication and Loss in Attacks on Quantum Position Verification