Computing the distance between quantum channels: Usefulness of the Fano representation

Abstract

The diamond norm measures the distance between two quantum channels. From an operational vewpoint, this norm measures how well we can distinguish between two channels by applying them to input states of arbitrarily large dimensions. In this paper, we show that the diamond norm can be conveniently and in a physically transparent way computed by means of a Monte-Carlo algorithm based on the Fano representation of quantum states and quantum operations. The effectiveness of this algorithm is illustrated for several single-qubit quantum channels.

8 pages, 7 figures

References in corpus (8)

• Statistical distinguishability between unitary operations
• Using entanglement improves precision of quantum measurements
• Optimal discrimination of quantum operations
• Quantum information and precision measurement
• Entanglement can enhance the distinguishability of entanglement-breaking channels
• Minimax discrimination of two Pauli channels
• A simple representation of quantum process tomography
• Effects of single-qubit quantum noise on entanglement purification

Cited by in corpus (27)

• Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography
• Cat codes with optimal decoherence suppression for a lossy bosonic channel
• Lindblad Tomography of a Superconducting Quantum Processor
• Dynamical Casimir Effect in Quantum Information Processing
• Dynamical Casimir effect and minimal temperature in quantum thermodynamics
• Simulation of non-Pauli Channels
• Entanglement-Free Parameter Estimation of Generalized Pauli Channels
• Multi-qubit time-varying quantum channels for NISQ-era superconducting quantum processors
• Randomized Benchmarking in the Analogue Setting
• Parallel tomography of quantum non-demolition measurements in multi-qubit devices
• Quantum-machine-learning channel discrimination
• Non-Markovian memory in IBMQX4
• Scalable quantum control and non-abelian anyon creation in the Kitaev honeycomb model
• Recovery With Incomplete Knowledge: Fundamental Bounds on Real-Time Quantum Memories
• Augmented fidelities for single qubit gates
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• Quantum Mechanics With Noncommutative Amplitudes
• Error Correction for Reliable Quantum Computing
• Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation
• The Role of Entanglement in Quantum Communication, and Analysis of the Detection Loophole
• Influence of Random Telegraph Noise on Quantum Bit Gate Operation
• Guaranteeing Completely Positive Quantum Evolution
• Batched quantum state exponentiation and quantum Hebbian learning
• Ancilla-Assisted Protection of Information: Application to Atom-Cavity Systems
• Disguising quantum channels by mixing and channel distance trade-off
• (2+1)D quantum electrodynamics at finite density on a quantum computer
• Quantum Private Broadcasting