Classically Replaceable Operations
arXiv:2203.14244 · doi:10.22331/q-2022-10-24-845
Abstract
Quantum information science provides powerful technologies beyond the scope of classical physics. In practice, accurate control of quantum operations is a challenging task with current quantum devices. The implementation of high fidelity and multi-qubit quantum operations consumes massive resources and requires complicated hardware design to fight against noise. An approach to alleviating this problem is to replace quantum operations with classical processing. Despite the common practice of this approach, rigorous criteria to determine whether a given quantum operation is replaceable classically are still missing. In this work, we define the classically replaceable operations in four general scenarios. In each scenario, we provide their necessary and sufficient criteria and point out the corresponding classical processing. For a practically favorable case of unitary classically replaceable operations, we show that the replaced classical processing is deterministic. Beyond that, we regard the irreplaceability of quantum operations by classical processing as a quantum resource and relate it to the performance of a channel in a non-local game, as manifested in a robustness measure.
arXiv comment40 pages, 14 figures
References in corpus (34)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum cryptography: Public key distribution and coin tossing
- Variational Quantum Algorithms
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Quantifying Coherence
- Quantum computational advantage using photons
- Quantifying Entanglement
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Quantum Coherence as a Resource
- Secure quantum key distribution with realistic devices
- Quantum Resource Theories
- Quantum Computing with Very Noisy Devices
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Strong quantum computational advantage using a superconducting quantum processor
- General Entanglement Breaking Channels
- Robustness of entanglement
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- The general structure of quantum resource theories
- General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks
- Quantifying Superposition
- Resource Destroying Maps
- Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
- Quantifying quantum resources with conic programming
- Operational Resource Theory of Quantum Channels
- A resource theory of quantum memories and their faithful verification with minimal assumptions
- Resource theory of coherence based on positive-operator-valued measures
- Quantum resource theories in the single-shot regime
- Entangling power and quantum circuit complexity
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- Entropy of a quantum channel
- Universal and Operational Benchmarking of Quantum Memories
- Subspace preserving completely positive maps
- Gluing of completely positive maps
- Subspace local quantum channels