Parallel quantum trajectories via forking for sampling without redundancy
arXiv:1902.07959 · doi:10.1088/1367-2630/ab35fb
Abstract
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state for every execution of an algorithm. Thus, the advantage of quantum computation can diminish due to redundant state initialization. We present a framework based on quantum forking that bypasses this fundamental issue and expedites a family of tasks that require sampling from independent quantum processes. Quantum forking propagates an input state to multiple quantum trajectories in superposition, and a weighted power sum of individual results from each trajectories is obtained in one measurement via quantum interference. The significance of our work is demonstrated via applications to implementing non-unitary quantum channels, studying entanglement and benchmarking quantum control. A proof-of-principle experiment is implemented on the IBM and Rigetti quantum cloud platforms.
arXiv comment17 pages, 6 figures
References in corpus (28)
- Mixed State Entanglement and Quantum Error Correction
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantum random access memory
- Bell Inequalities and the Separability Criterion
- Robust randomized benchmarking of quantum processes
- Efficient variational quantum simulator incorporating active error minimisation
- Practical Quantum Error Mitigation for Near-Future Applications
- Scalable Noise Estimation with Random Unitary Operators
- Quantum-state preparation with universal gate decompositions
- Architectures for a quantum random access memory
- Symmetrised Characterisation of Noisy Quantum Processes
- Efficient decomposition of quantum gates
- Entanglement witnesses: construction, analysis and classification
- Estimating the Coherence of Noise
- Circuit-Based Quantum Random Access Memory for Classical Data
- Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State
- On the robustness of bucket brigade quantum RAM
- Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
- Experimentally scalable protocol for identification of correctable codes
- Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
- Entanglement witness operator for quantum teleportation
- Practical experimental certification of computational quantum gates via twirling
- A Robust Quantum Random Access Memory
- Comparison of a quantum error correction threshold for exact and approximate errors
- Estimating the coherence of noise in quantum control of a solid-state qubit
- Progress toward scalable tomography of quantum maps using twirling-based methods and information hierarchies
- Programmable Superpositions of Ising Configurations
- Secure assisted quantum computation