82,474 research outputs found
On compression rate of quantum autoencoders: Control design, numerical and experimental realization
Quantum autoencoders which aim at compressing quantum information in a
low-dimensional latent space lie in the heart of automatic data compression in
the field of quantum information. In this paper, we establish an upper bound of
the compression rate for a given quantum autoencoder and present a learning
control approach for training the autoencoder to achieve the maximal
compression rate. The upper bound of the compression rate is theoretically
proven using eigen-decomposition and matrix differentiation, which is
determined by the eigenvalues of the density matrix representation of the input
states. Numerical results on 2-qubit and 3-qubit systems are presented to
demonstrate how to train the quantum autoencoder to achieve the theoretically
maximal compression, and the training performance using different machine
learning algorithms is compared. Experimental results of a quantum autoencoder
using quantum optical systems are illustrated for compressing two 2-qubit
states into two 1-qubit states
Speeding-up the decision making of a learning agent using an ion trap quantum processor
We report a proof-of-principle experimental demonstration of the quantum
speed-up for learning agents utilizing a small-scale quantum information
processor based on radiofrequency-driven trapped ions. The decision-making
process of a quantum learning agent within the projective simulation paradigm
for machine learning is implemented in a system of two qubits. The latter are
realized using hyperfine states of two frequency-addressed atomic ions exposed
to a static magnetic field gradient. We show that the deliberation time of this
quantum learning agent is quadratically improved with respect to comparable
classical learning agents. The performance of this quantum-enhanced learning
agent highlights the potential of scalable quantum processors taking advantage
of machine learning.Comment: 21 pages, 7 figures, 2 tables. Author names now spelled correctly;
sections rearranged; changes in the wording of the manuscrip
A generative modeling approach for benchmarking and training shallow quantum circuits
Hybrid quantum-classical algorithms provide ways to use noisy
intermediate-scale quantum computers for practical applications. Expanding the
portfolio of such techniques, we propose a quantum circuit learning algorithm
that can be used to assist the characterization of quantum devices and to train
shallow circuits for generative tasks. The procedure leverages quantum hardware
capabilities to its fullest extent by using native gates and their qubit
connectivity. We demonstrate that our approach can learn an optimal preparation
of the Greenberger-Horne-Zeilinger states, also known as "cat states". We
further demonstrate that our approach can efficiently prepare approximate
representations of coherent thermal states, wave functions that encode
Boltzmann probabilities in their amplitudes. Finally, complementing proposals
to characterize the power or usefulness of near-term quantum devices, such as
IBM's quantum volume, we provide a new hardware-independent metric called the
qBAS score. It is based on the performance yield in a specific sampling task on
one of the canonical machine learning data sets known as Bars and Stripes. We
show how entanglement is a key ingredient in encoding the patterns of this data
set; an ideal benchmark for testing hardware starting at four qubits and up. We
provide experimental results and evaluation of this metric to probe the trade
off between several architectural circuit designs and circuit depths on an
ion-trap quantum computer.Comment: 16 pages, 9 figures. Minor revisions. As published in npj Quantum
Informatio
- …