Measuring all compatible operators in one series of single-qubit measurements using unitary transformations.

The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or compatible operators simultaneously. Unfortunately, the current hardware permits measuring only a much more limited subset of operators that share a common tensor product eigen-basis. We introduce unitary transformations that transform any fully commuting group of operators to a group that can be measured on current hardware. These unitary operations can be encoded as a sequence of Clifford gates and let us not only measure much larger groups of terms but also to obtain these groups efficiently on a classical computer. The problem of finding the minimum number of fully commuting groups of terms covering the whole Hamiltonian is found to be equivalent to the minimum clique cover problem for a graph representing Hamiltonian terms as vertices and commutativity between them as edges. Tested on few molecular electronic Hamiltonians with up to fifty thousand terms, the introduced technique allows for the reduction of the number of separately measurable operator groups down to few hundreds, thus achieving up to two orders of magnitude reduction. Based on the test set results, the obtained gain scales at least linearly with the number of qubits.

[1]  Kanav Setia,et al.  Bravyi-Kitaev Superfast simulation of electronic structure on a quantum computer. , 2017, The Journal of chemical physics.

[2]  Trygve Helgaker,et al.  Molecular Electronic-Structure Theory: Helgaker/Molecular Electronic-Structure Theory , 2000 .

[3]  Tzu-Ching Yen,et al.  Unitary partitioning approach to the measurement problem in the Variational Quantum Eigensolver method. , 2019, Journal of chemical theory and computation.

[4]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[5]  W. Wootters,et al.  Optimal state-determination by mutually unbiased measurements , 1989 .

[6]  A. Kitaev,et al.  Fermionic Quantum Computation , 2000, quant-ph/0003137.

[7]  Philip Walther,et al.  Experimental superposition of orders of quantum gates , 2014, Nature Communications.

[8]  D. J. A. Welsh,et al.  An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..

[9]  Ronald D. Dutton,et al.  A New Graph Colouring Algorithm , 1981, Comput. J..

[10]  MUB tomography performance under influence of systematic errors , 2018 .

[11]  D. James,et al.  Qubit quantum state tomography , 2004 .

[12]  Raman Kashyap,et al.  High-dimensional one-way quantum processing implemented on d-level cluster states , 2018, Nature Physics.

[13]  P. Love,et al.  The Bravyi-Kitaev transformation for quantum computation of electronic structure. , 2012, The Journal of chemical physics.

[14]  R. Prevedel,et al.  High-speed linear optics quantum computing using active feed-forward , 2007, Nature.

[15]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[16]  J. Cirac,et al.  Goals and opportunities in quantum simulation , 2012, Nature Physics.

[17]  M. Head‐Gordon,et al.  Simulated Quantum Computation of Molecular Energies , 2005, Science.

[18]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

[19]  D. Gross,et al.  Efficient quantum state tomography. , 2010, Nature communications.

[20]  Alán Aspuru-Guzik,et al.  Adiabatic Quantum Simulation of Quantum Chemistry , 2013, Scientific Reports.

[21]  Scott N. Genin,et al.  Qubit Coupled Cluster Method: A Systematic Approach to Quantum Chemistry on a Quantum Computer. , 2018, Journal of chemical theory and computation.

[22]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[23]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[24]  J. Haladyn Comb , 2019, Duchamp, Aesthetics and Capitalism.

[25]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[26]  Sarah E. Sofia,et al.  The Bravyi-Kitaev transformation: Properties and applications , 2015 .

[27]  Isaac L. Chuang,et al.  Quantum Computation and Quantum Information: Frontmatter , 2010 .

[28]  Charles-Michel Marle,et al.  Symplectic geometry and analytical mechanics , 1987 .