Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation and optimization techniques that massively reduce the entangling-gate counts. We exploit the well-studied non-quantum optimization algorithms to achieve up to 24\% savings over the state of the art for several small-molecule simulations, with no loss of accuracy or hidden costs. Our methodologies straightforwardly generalize to wider classes of near-term simulations of the ground state of a fermionic system or real-time simulations probing dynamical properties of a fermionic system.
The fermionic SWAP network is a qubit routing sequence that can be used to efficiently execute the Quantum Approximate Optimization Algorithm (QAOA). Even with a minimally-connected topology on an n-qubit processor, this routing sequence enables O(n^2) operations to execute in O(n) steps. In this work, we optimize the execution of fermionic SWAP networks for QAOA through two techniques. First, we take advantage of an overcomplete set of native hardware operations [including 150 ns controlled-pi/2 phase gates with up to 99.67(1)% fidelity] in order to decompose the relevant quantum gates and SW…
The ability to simulate a fermionic system on a quantum computer is expected to revolutionize chemical engineering, materials design, nuclear physics, to name a few. Thus, optimizing the simulation circuits is of significance in harnessing the power of quantum computers. Here, we address this problem in two aspects. In the fault-tolerant regime, we optimize the $\rzgate$ and $\tgate$ gate counts along with the ancilla qubit counts required, assuming the use of a product-formula algorithm for implementation. We obtain a savings ratio of two in the gate counts and a savings ratio of eleven in th…
Resource-efficient energy-based operator selection in fermionic ADAPT-VQE via exact Hamiltonian transformation
DTU Chemistry, Technical University of Denmark（丹麦技术大学化学系）；Department of Physics, Chemistry and Pharmacy, University of Southern Denmark（南丹麦大学物理、化学与药学系）；University of Toronto Scarborough（多伦多大学士嘉堡分校）；Chemical Physics Theory Group, Department of Chemistry, University of Toronto（多伦多大学化学系化学生物物理理论组）；Department of Chemistry, University of Copenhagen（哥本哈根大学化学系）；School of Chemistry, University of Southampton（南安普顿大学化学学院）
Fermionic systems differ from bosonic ones in several ways, in particular that the time-reversal operator $T$ is odd, $T^2=-1$. For $PT$-symmetric bosonic systems, the no-signaling principle and the quantum brachistochrone problem have been studied to some degree, both of them controversially. In this paper, we apply the basic methods proposed for bosonic systems to {\it fermionic} two- and four-dimensional $PT$-symmetric Hamiltonians, and obtain several surprising results: We find - in contrast to the bosonic case - that the no-signaling principle is upheld for two-dimensional fermionic Hamil…
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining the same gate set. Here we study magic states in the context of matchgate (MG) circuits, where the notion becomes more subtle, as MGs are subject to locality constraints and also the SWAP gate is not available. Nevertheless a similar picture of gate-gadget constructions applies, and we show that every pure fermionic state which is non-Gaussian, i.e. which cannot be generated by MGs from a computational basis state, …
Optimal and improved gate decompositions for accelerated classical simulation of near-Gaussian fermionic circuits
Phasecraft Ltd（Phasecraft有限公司）；Department of Mathematics, School of Computation, Information and Technology, Technical University of Munich（慕尼黑工业大学计算、信息与技术学院数学系）；Munich Center for Quantum Science and Technology（慕尼黑量子科学与技术中心）
Robust exponential lower bounds for fermionic and bosonic Gaussian ranks
Yau Mathematical Sciences Center, Tsinghua University（清华大学丘成桐数学科学中心）；Qiuzhen College, Tsinghua University（清华大学求真学院）；Department of Mathematics, Tsinghua University（清华大学数学系）；Yanqi Lake Beijing Institute of Mathematical Sciences and Applications（北京雁栖湖应用数学研究院）
Technical University of Munich（慕尼黑工业大学）；Wigner Research Centre for Physics（维格纳物理研究中心）；Budapest University of Technology and Economics（布达佩斯技术与经济大学）；Institute for Advanced Study, Technical University of Munich（慕尼黑工业大学高等研究院）
Perimeter Institute for Theoretical Physics（佩里尔研究所）；Institute for Quantum Computing, University of Waterloo（滑铁卢大学量子计算研究所）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）；Department of Applied Mathematics, University of Waterloo（滑铁卢大学应用数学系）；Department of Combinatorics and Optimization, University of Waterloo（滑铁卢大学组合优化系）
Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems. A level-p QAOA circuit consists of p steps; in each step a classical Hamiltonian, derived from the cost function, is applied followed by a mixing Hamiltonian. The 2p times for which these two Hamiltonians are applied are the parameters of the algorithm, which are to be optimized classically for the best performance. As p increases, parameter optimization becomes inefficient due to the curse of dimensionality. The suc…
An important aspect of quantum simulation is the preparation of physically interesting states on a quantum computer, and this task can often be costly or challenging to implement. A digital, ``site-by-site'' scheme of state preparation was introduced in arXiv:1911.03505 as a way to prepare the vacuum state of certain fermionic field theory Hamiltonians with a mass gap. More generally, this algorithm may be used to prepare ground states of Hamiltonians by adding one site at a time as long as successive intermediate ground states share a non-zero overlap and the Hamiltonian has a non-vanishing s…
In previous research, quantum resources were concretely estimated for solving Elliptic Curve Discrete Logarithm Problem(ECDLP). In [1], the quantum algorithm was optimized for the binary elliptic curves and the main optimization target was the number of the logical qubits. The division algorithm was mainly optimized in [1] since every ancillary qubit is used in the division algorithm. In this paper, we suggest a new quantum division algorithm on the binary field which uses a smaller number of qubits. For elements in a field of $2^n$, we can save $\lceil n/2 \rceil - 1$ qubits instead of using …
Efficient low temperature simulations for fermionic reservoirs with the hierarchical equations of motion method: Application to the Anderson impurity model
Digital quantum simulation uses the capabilities of quantum computers to determine the dynamics of quantum systems, which are beyond the computability of modern classical computers. A notoriously challenging task in this field is the description of non-equilibrium dynamics in quantum many-body systems. Here we use the IBM quantum computers to simulate the non-equilibrium dynamics of few spin and fermionic systems. Our results reveal, that with a combination of error mitigation, noise extrapolation and optimized initial state preparation, one can tackle the most important drawbacks of modern qu…
We develop a machine learning method to construct accurate ground-state wave functions of strongly interacting and entangled quantum spin as well as fermionic models on lattices. A restricted Boltzmann machine algorithm in the form of an artificial neural network is combined with a conventional variational Monte Carlo method with pair product (geminal) wave functions and quantum number projections. The combination allows an application of the machine learning scheme to interacting fermionic systems. The combined method substantially improves the accuracy beyond that ever achieved by each metho…
We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models. In particular, we found a wider variety of scattering processes, we have bound states for every value of the total momentum, and there exist bound states also in the free case, where the coupling constant is null.
Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation
Bandung Institute of Technology（万隆理工学院）；National Research and Innovation Agency (BRIN)（国家研究与创新署）；National University of Singapore（新加坡国立大学）；Nanyang Technological University（南洋理工大学）
