Hartree-Fock on a superconducting qubit quantum computer
- URL: http://arxiv.org/abs/2004.04174v4
- Date: Fri, 18 Sep 2020 22:16:59 GMT
- Title: Hartree-Fock on a superconducting qubit quantum computer
- Authors: Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin,
Rami Barends, Sergio Boixo, Michael Broughton, Bob B. Buckley, David A.
Buell, Brian Burkett, Nicholas Bushnell, Yu Chen, Zijun Chen, Benjamin
Chiaro, Roberto Collins, William Courtney, Sean Demura, Andrew Dunsworth,
Daniel Eppens, Edward Farhi, Austin Fowler, Brooks Foxen, Craig Gidney,
Marissa Giustina, Rob Graff, Steve Habegger, Matthew P. Harrigan, Alan Ho,
Sabrina Hong, Trent Huang, William J. Huggins, Lev Ioffe, Sergei V. Isakov,
Evan Jeffrey, Zhang Jiang, Cody Jones, Dvir Kafri, Kostyantyn Kechedzhi,
Julian Kelly, Seon Kim, Paul V. Klimov, Alexander Korotkov, Fedor Kostritsa,
David Landhuis, Pavel Laptev, Mike Lindmark, Erik Lucero, Orion Martin, John
M. Martinis, Jarrod R. McClean, Matt McEwen, Anthony Megrant, Xiao Mi, Masoud
Mohseni, Wojciech Mruczkiewicz, Josh Mutus, Ofer Naaman, Matthew Neeley,
Charles Neill, Hartmut Neven, Murphy Yuezhen Niu, Thomas E. O'Brien, Eric
Ostby, Andre Petukhov, Harald Putterman, Chris Quintana, Pedram Roushan,
Nicholas C. Rubin, Daniel Sank, Kevin J. Satzinger, Vadim Smelyanskiy, Doug
Strain, Kevin J. Sung, Marco Szalay, Tyler Y. Takeshita, Amit Vainsencher,
Theodore White, Nathan Wiebe, Z. Jamie Yao, Ping Yeh, Adam Zalcman
- Abstract summary: Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates.
We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene.
We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
- Score: 30.152226344347064
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As the search continues for useful applications of noisy intermediate scale
quantum devices, variational simulations of fermionic systems remain one of the
most promising directions. Here, we perform a series of quantum simulations of
chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and
114 one-qubit gates. We model the binding energy of ${\rm H}_6$, ${\rm H}_8$,
${\rm H}_{10}$ and ${\rm H}_{12}$ chains as well as the isomerization of
diazene. We also demonstrate error-mitigation strategies based on
$N$-representability which dramatically improve the effective fidelity of our
experiments. Our parameterized ansatz circuits realize the Givens rotation
approach to non-interacting fermion evolution, which we variationally optimize
to prepare the Hartree-Fock wavefunction. This ubiquitous algorithmic primitive
corresponds to a rotation of the orbital basis and is required by many
proposals for correlated simulations of molecules and Hubbard models. Because
non-interacting fermion evolutions are classically tractable to simulate, yet
still generate highly entangled states over the computational basis, we use
these experiments to benchmark the performance of our hardware while
establishing a foundation for scaling up more complex correlated quantum
simulations of chemistry.
Related papers
- Observation of a non-Hermitian supersonic mode [6.846670002217106]
We demonstrate the power of variational quantum circuits for resource-efficient simulations of dynamical and equilibrium physics in non-Hermitian systems.
Using a variational quantum compilation scheme for fermionic systems, we reduce gate count, save qubits, and eliminate the need for postselection.
We provide an analytical example demonstrating that simulating single-qubit non-Hermitian dynamics for $Theta(log(n))$ time from certain initial states is exponentially hard on a quantum computer.
arXiv Detail & Related papers (2024-06-21T18:00:06Z) - Quantum simulation of Fermi-Hubbard model based on transmon qudit
interaction [0.0]
We introduce a novel quantum simulation approach utilizing qudits to overcome such complexities.
We first demonstrate a Qudit Fermionic Mapping (QFM) that reduces the encoding cost associated with the qubit-based approach.
We then describe the unitary evolution of the mapped Hamiltonian by interpreting the resulting Majorana operators in terms of physical single- and two-qudit gates.
arXiv Detail & Related papers (2024-02-02T09:10:40Z) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Qubit-efficient encoding scheme for quantum simulations of electronic
structure [5.16230883032882]
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits.
We propose a qubit-efficient encoding scheme that requires the qubit number to be only logarithmic in the number of configurations that satisfy the required conditions and symmetries.
Our proposed scheme and results show the feasibility of quantum simulations for larger molecular systems in the noisy intermediate-scale quantum (NISQ) era.
arXiv Detail & Related papers (2021-10-08T13:20:18Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Quantum-optimal-control-inspired ansatz for variational quantum
algorithms [105.54048699217668]
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form.
Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries.
This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
arXiv Detail & Related papers (2020-08-03T18:00:05Z) - Efficient quantum circuits for quantum computational chemistry [0.0]
Efficient ways to perform fermionic excitations are vital for the realization of the variational quantum eigensolver (VQE) on noisy intermediate-scale quantum computers.
We demonstrate circuits that perform qubit excitations, excitations that do not account for fermionic anticommutation relations.
Compared to circuits constructed with the standard use of "$CNOT$ staircases," our circuits offer a linear reduction in the number of $CNOT$ gates.
arXiv Detail & Related papers (2020-05-29T09:46:23Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.