Loading Classical Data into a Quantum Computer

Abstract

This document describes a family of quantum circuits which load classical data into a quantum state. When loading $N$ classical bits, the result quantum state is of order ${\log }_2(N)$ qubits. Furthermore the gate depth of the data loading circuit is of order ${\log }_2(N)$. Limitations to the efficiency of the data loading process such as the Holevo bound are discussed. Methods to improve the efficiency of the data loading procedure such as combining classical compression techniques with quantum decompression circuitry, are also discussed. Simulations using the Quipper language were conducted to verify the circuits behavior.

Thirty eight pages. Portions of this document were presented as a poster at QIP2018

Cited by in corpus (12)

• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Quantum Machine Learning for Finance
• Networked Quantum Services
• QuClassi: A Hybrid Deep Neural Network Architecture based on Quantum State Fidelity
• Encoding classical data into a quantum computer
• Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
• Quantum Radio Astronomy: Data Encodings and Quantum Image Processing
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• An example of use of Variational Methods in Quantum Machine Learning
• State preparation based on quantum phase estimation
• Towards a Pattern Language for Quantum Algorithms
• Quantum Algorithms for Unsupervised Machine Learning and Neural Networks