Quantum autoencoders for efficient compression of quantum data

被引:366
作者
Romero, Jonathan [1 ]
Olson, Jonathan P. [1 ]
Aspuru-Guzik, Alan [1 ]
机构
[1] Harvard Univ, Dept Chem & Chem Biol, Cambridge, MA 02138 USA
关键词
quantum computing; machine learning; autoencoders; data compression; quantum simulation; !text type='PYTHON']PYTHON[!/text] FRAMEWORK; DYNAMICS; QUTIP; GATE;
D O I
10.1088/2058-9565/aa8072
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Classical autoencoders are neural networks that can learn efficient low-dimensional representations of data in higher-dimensional space. The task of an autoencoder is, given an input x, to map x to a lower dimensional point y such that x can likely be recovered from y. The structure of the underlying autoencoder network can be chosen to represent the data on a smaller dimension, effectively compressing the input. Inspired by this idea, we introduce the model of a quantum autoencoder to perform similar tasks on quantum data. The quantum autoencoder is trained to compress a particular data set of quantum states, where a classical compression algorithm cannot be employed. The parameters of the quantum autoencoder are trained using classical optimization algorithms. We show an example of a simple programmable circuit that can be trained as an efficient autoencoder. We apply our model in the context of quantum simulation to compress ground states of the Hubbard model and molecular Hamiltonians.
引用
收藏
页数:12
相关论文
共 41 条
[1]  
Abeyesinghe A, 2009, P ROYAL SOC A, V465, P2537
[2]  
[Anonymous], 2007, PATTERN RECOGN, V16
[3]  
[Anonymous], ARXIV161109347
[4]   Simulated quantum computation of molecular energies [J].
Aspuru-Guzik, A ;
Dutoi, AD ;
Love, PJ ;
Head-Gordon, M .
SCIENCE, 2005, 309 (5741) :1704-1707
[5]   A strategy for quantum algorithm design assisted by machine learning [J].
Bang, Jeongho ;
Ryu, Junghee ;
Yoo, Seokwon ;
Pawlowski, Marcin ;
Lee, Jinhyoung .
NEW JOURNAL OF PHYSICS, 2014, 16
[6]   Superconducting quantum circuits at the surface code threshold for fault tolerance [J].
Barends, R. ;
Kelly, J. ;
Megrant, A. ;
Veitia, A. ;
Sank, D. ;
Jeffrey, E. ;
White, T. C. ;
Mutus, J. ;
Fowler, A. G. ;
Campbell, B. ;
Chen, Y. ;
Chen, Z. ;
Chiaro, B. ;
Dunsworth, A. ;
Neill, C. ;
O'Malley, P. ;
Roushan, P. ;
Vainsencher, A. ;
Wenner, J. ;
Korotkov, A. N. ;
Cleland, A. N. ;
Martinis, John M. .
NATURE, 2014, 508 (7497) :500-503
[7]  
Ben-Aroya A, 2007, ARXIVQUANTPH0702129
[8]   Quantum fingerprinting [J].
Buhrman, H ;
Cleve, R ;
Watrous, J ;
de Wolf, R .
PHYSICAL REVIEW LETTERS, 2001, 87 (16)
[9]   A LIMITED MEMORY ALGORITHM FOR BOUND CONSTRAINED OPTIMIZATION [J].
BYRD, RH ;
LU, PH ;
NOCEDAL, J ;
ZHU, CY .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1995, 16 (05) :1190-1208
[10]   Universal programmable quantum circuit schemes to emulate an operator [J].
Daskin, Anmer ;
Grama, Ananth ;
Kollias, Giorgos ;
Kais, Sabre .
JOURNAL OF CHEMICAL PHYSICS, 2012, 137 (23)