On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing

Mapping functions on bits to Hamiltonians acting on qubits has many applications in quantum computing. In particular, Hamiltonians representing Boolean functions are required for applications of quantum annealing or the quantum approximate optimization algorithm to combinatorial optimization problems. We show how such functions are naturally represented by Hamiltonians given as sums of Pauli Z operators (Ising spin operators) with the terms of the sum corresponding to the function’s Fourier expansion. For many classes of Boolean functions which are given by a compact description, such as a Boolean formula in conjunctive normal form that gives an instance of the satisfiability problem, it is #P-hard to compute its Hamiltonian representation, i.e., as hard as computing its number of satisfying assignments. On the other hand, no such difficulty exists generally for constructing Hamiltonians representing a real function such as a sum of local Boolean clauses each acting on a fixed number of bits as is common in constraint satisfaction problems. We show composition rules for explicitly constructing Hamiltonians representing a wide variety of Boolean and real functions by combining Hamiltonians representing simpler clauses as building blocks, which are particularly suitable for direct implementation as classical software. We further apply our results to the construction of controlled-unitary operators, and to the special case of operators that compute function values in an ancilla qubit register. Finally, we outline several additional applications and extensions of our results to quantum algorithms for optimization. A goal of this work is to provide a design toolkit for quantum optimization which may be utilized by experts and practitioners alike in the construction and analysis of new quantum algorithms, and at the same time to provide a unified framework for the various constructions appearing in the literature.

[1]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[2]  Elchanan Mossel,et al.  Real Analysis in Computer Science: A collection of Open Problems , 2014 .

[3]  H. Nishimori Statistical Physics of Spin Glasses and Information Processing , 2001 .

[4]  Hartmut Neven,et al.  Fourier analysis of sampling from noisy chaotic quantum circuits , 2017, 1708.01875.

[5]  Richard Beigel,et al.  The polynomial method in circuit complexity , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[6]  Alán Aspuru-Guzik,et al.  Efficient quantum circuits for diagonal unitaries without ancillas , 2013, 1306.3991.

[7]  P. Woit Quantum Theory, Groups and Representations , 2017 .

[8]  Fabián A. Chudak,et al.  The Ising model : teaching an old problem new tricks , 2010 .

[9]  Ashley Montanaro,et al.  Quantum boolean functions , 2008, Chic. J. Theor. Comput. Sci..

[10]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

[11]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[12]  Peter Woit,et al.  Quantum Theory, Groups and Representations: An Introduction (under construction) , 2016 .

[13]  Catherine C. McGeoch Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice , 2014, Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice.

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

[15]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[16]  Masayuki Ohzeki,et al.  Breaking limitation of quantum annealer in solving optimization problems under constraints , 2020, Scientific Reports.

[17]  J. D. Biamonte,et al.  Ground-state spin logic , 2012, 1205.1742.

[18]  Itay Hen,et al.  Driver Hamiltonians for constrained optimization in quantum annealing , 2016, 1602.07942.

[19]  Michele Mosca,et al.  On the CNOT-complexity of CNOT-PHASE circuits , 2017, 1712.01859.

[20]  Michael Broughton,et al.  A quantum algorithm to train neural networks using low-depth circuits , 2017, 1712.05304.

[21]  Seung Woo Shin,et al.  Quantum Hamiltonian Complexity , 2014, Found. Trends Theor. Comput. Sci..

[22]  Martin Roetteler,et al.  Quantum Circuits for Functionally Controlled NOT Gates , 2020, 2020 IEEE International Conference on Quantum Computing and Engineering (QCE).

[23]  Dave Bacon,et al.  Making Classical Ground State Spin Computing Fault-Tolerant , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  F. Barahona On the computational complexity of Ising spin glass models , 1982 .

[25]  Steven Givant,et al.  Introduction to Boolean Algebras , 2008 .

[26]  R. Jozsa,et al.  Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy , 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[27]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[28]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  A. Szabó,et al.  Modern quantum chemistry : introduction to advanced electronic structure theory , 1982 .

[31]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[32]  J. Biamonte Non−perturbative k−body to two−body commuting conversion Hamiltonians and embedding problem instances into Ising spins , 2008, 0801.3800.

[33]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[34]  Ronald de Wolf,et al.  A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..

[35]  H. Dishkant,et al.  Logic of Quantum Mechanics , 1976 .

[36]  M. A. Nielsen Computable Functions, Quantum Measurements, and Quantum Dynamics , 1997 .

[37]  Ashley Montanaro,et al.  Achieving quantum supremacy with sparse and noisy commuting quantum computations , 2016, 1610.01808.

[38]  E. Knill,et al.  Power of One Bit of Quantum Information , 1998, quant-ph/9802037.

[39]  Stacey Jeffery,et al.  The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation , 2018, ICALP.

[40]  T. Cubitt,et al.  Universal quantum Hamiltonians , 2017, Proceedings of the National Academy of Sciences.

[41]  Alán Aspuru-Guzik,et al.  Resource efficient gadgets for compiling adiabatic quantum optimization problems , 2013, 1307.8041.

[42]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[43]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 2005, computational complexity.

[44]  E. Lieb,et al.  Two Soluble Models of an Antiferromagnetic Chain , 1961 .

[45]  Andrew M. Childs,et al.  Quantum information processing in continuous time , 2004 .

[46]  Rupak Biswas,et al.  Quantum Approximate Optimization with Hard and Soft Constraints , 2017 .

[47]  Andris Ambainis Polynomial degree vs. quantum query complexity , 2006, J. Comput. Syst. Sci..

[48]  Jens Siewert,et al.  Programmable networks for quantum algorithms. , 2003, Physical review letters.

[49]  Michele Mosca,et al.  On the controlled-NOT complexity of controlled-NOT–phase circuits , 2018, Quantum Science and Technology.

[50]  Andris Ambainis,et al.  Polynomial degree vs. quantum query complexity , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[51]  J. R. Buzeman Introduction To Boolean Algebras , 1961 .

[52]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[53]  Tad Hogg,et al.  Quantum optimization , 2000, Inf. Sci..

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

[55]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[56]  西森 秀稔 Statistical physics of spin glasses and information processing : an introduction , 2001 .

[57]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[58]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1993, JACM.

[59]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[60]  Richard Tanburn,et al.  Reducing multi-qubit interactions in adiabatic quantum computation without adding auxiliary qubits. Part 1: The "deduc-reduc" method and its application to quantum factorization of numbers , 2015, ArXiv.

[61]  Itay Hen,et al.  Quantum Annealing for Constrained Optimization , 2015, 1508.04212.

[62]  Rupak Biswas,et al.  From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.

[63]  Yingfei Gu,et al.  Majorana fermions and the Sensitivity Conjecture , 2019, ArXiv.

[64]  Felix Wu,et al.  The quantum query complexity of approximating the median and related statistics , 1998, STOC '99.

[65]  Arvid J. Bessen The power of various real-valued quantum queries , 2004, J. Complex..

[66]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[67]  A. Neumaier,et al.  Classical and quantum mechanics via Lie algebras , 2008, 0810.1019.

[68]  Robert König,et al.  Quantum advantage with shallow circuits , 2017, Science.