Quantum process tomography of unitary and near-unitary maps

Abstract

We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a $d$-level system is completely characterized by a minimal set of $d^2+d$ elements associated with a collection of POVMs, in contrast to the $d^4-d^2$ elements required for a general completely positive trace-preserving map. To achieve this lower bound, one must probe the map with a particular set of $d$ pure states. We further compare the performance of different compressed sensing algorithms used to reconstruct a near-unitary process from such data. We find that when we have accurate prior information, an appropriate compressed sensing method reduces the required data needed for high-fidelity estimation, and different estimators applied to the same data are sensitive to different types of noise. Compressed sensing techniques can therefore be used both as indicators of error models and to validate the use of the prior assumptions.

11 pages, 3 figures

References in corpus (10)

• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Quantum Tomography via Compressed Sensing: Error Bounds, Sample Complexity, and Efficient Estimators
• Characterization of addressability by simultaneous randomized benchmarking
• Randomized benchmarking and process tomography for gate errors in a solid-state qubit
• Randomized Benchmarking of Multi-Qubit Gates
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• Random Quantum Operations
• Quantum state tomography by continuous measurement and compressed sensing
• Randomized benchmarking of atomic qubits in an optical lattice

Cited by in corpus (34)

• Compressed sensing quantum process tomography for superconducting quantum gates
• Scalable reconstruction of unitary processes and Hamiltonians
• Robust and Efficient Hamiltonian Learning
• Objective Compressive Quantum Process Tomography
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly
• Universal compressive characterization of quantum dynamics
• Gradient-descent quantum process tomography by learning Kraus operators
• Compressive gate set tomography
• Query-optimal estimation of unitary channels in diamond distance
• Single-preparation unsupervised quantum machine learning: concepts and applications
• Compressively certifying quantum measurements
• The Role of Topology in Quantum Tomography
• Modern compressive tomography for quantum information science
• Quantum SWAP gate realized with CZ and iSWAP gates in a superconducting architecture
• Quantum tomography of noisy ion-based qudits
• Machine learning of quantum channels on NISQ devices
• Quantum Process Tomography of Unitary Maps from Time-Delayed Measurements
• Context Aware Fidelity Estimation
• Process tomography in general physical theories
• Estimation of high-dimensional unitary transformations saturating the Quantum Cramér-Rao bound
• Group Sparse Matrix Optimization for Efficient Quantum State Transformation
• Universal compiling and (No-)Free-Lunch theorems for continuous variable quantum learning
• Benchmarking quantum tomography completeness and fidelity with machine learning
• Unitary quantum process tomography with unreliable pure input states
• Certifying Temporal Correlations
• Beyond the density operator and Tr(ρA): Exploiting the higher-order statistics of random-coefficient pure states for quantum information processing
• Parameterized quantum comb and simpler circuits for reversing unknown qubit-unitary operations
• Using non-convex optimization in quantum process tomography: Factored gradient descent is tough to beat
• Learning the structure of any Hamiltonian from minimal assumptions
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods
• A sparse-sampling approach for the fast computation of matrices: application to molecular vibrations
• Characterizing a high-dimensional unitary transformation without measuring the qudit it transforms
• Parameterized process characterization with reduced resource requirements
• Analytical Lower Bound on Query Complexity for Transformations of Unknown Unitary Operations