Convex optimization of programmable quantum computers
arXiv:1905.01316 · doi:10.1038/s41534-020-0268-2
Abstract
A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While being programmable, any finite-dimensional design of this model is known to be nonuniversal, meaning that the processor cannot perfectly simulate an arbitrary quantum channel over the input. Characterizing how close the simulation is and finding the optimal program state have been open questions for the past 20 years. Here, we answer these questions by showing that the search for the optimal program state is a convex optimization problem that can be solved via semidefinite programming and gradient-based methods commonly employed for machine learning. We apply this general result to different types of processors, from a shallow design based on quantum teleportation, to deeper schemes relying on port-based teleportation and parametric quantum circuits.
arXiv commentmerged with arXiv:1905.01318
References in corpus (20)
- Quantum Machine Learning
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Quantum Circuit Learning
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- An introduction to quantum machine learning
- Advances in Quantum Teleportation
- Advances in Photonic Quantum Sensing
- Quantum machine learning: a classical perspective
- Programmable quantum gate arrays
- A quantum-inspired classical algorithm for recommendation systems
- Asymptotic teleportation scheme as a universal programmable quantum processor
- Theory of channel simulation and bounds for private communication
- Fundamental limits to quantum channel discrimination
- Quantum teleportation scheme by selecting one of multiple output ports
- Quantum gate learning in engineered qubit networks: Toffoli gate with always-on interactions
- Efficient universal programmable quantum measurements
- Bounds for Entanglement via an Extension of Strong Subadditivity of Entropy
- Almost all quantum channels are equidistant
- Supervised learning of time-independent Hamiltonians for gate design
Cited by in corpus (26)
- Advances in Quantum Cryptography
- Fundamental limitations on distillation of quantum channel resources
- Ultimate limits for multiple quantum channel discrimination
- No-go theorems for quantum resource purification II: new approach and channel theory
- Training Gaussian Boson Sampling Distributions
- Gradient-descent quantum process tomography by learning Kraus operators
- Bounds on amplitude damping channel discrimination
- Mixed State Entanglement Classification using Artificial Neural Networks
- Generalization of port-based teleportation and controlled teleportation capability
- Characterising port-based teleportation as a universal simulator of qubit channels
- Multiport based teleportation -- transmission of a large amount of quantum information
- Programmability of covariant quantum channels
- Ultimate Limits of Thermal Pattern Recognition
- Optimal Multi-port-based Teleportation Schemes
- How to enhance quantum generative adversarial learning of noisy information
- Accuracy vs Memory Advantage in the Quantum Simulation of Stochastic Processes
- Gradient-descent methods for fast quantum state tomography
- Machine learning of quantum channels on NISQ devices
- An introductory review on resource theories of generalized nonclassical light
- Continuous variable port-based teleportation
- Ultimate limits of approximate unambiguous discrimination
- Analytical bounds for non-asymptotic asymmetric state discrimination
- Quantum Advantage in Storage and Retrieval of Isometry Channels
- A resource theory of asynchronous quantum information processing
- Square-root measurements and degradation of the resource state in port-based teleportation scheme
- On the distinguishability of geometrically uniform quantum states