Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers that is Universal, Systematically Improvable, and Size-consistent

• URL: http://arxiv.org/abs/2307.03563v2
• Date: Thu, 21 Dec 2023 12:10:19 GMT
• Title: Physics-Constrained Hardware-Efficient Ansatz on Quantum Computers that is Universal, Systematically Improvable, and Size-consistent
• Abstract summary: We introduce a physics-constrained approach for designing hardware-efficient ansatz (HEA) on quantum computers. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent. We present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity.
• Score: 1.1749564892273827
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Variational wavefunction ans\"{a}tze are at the heart of solving quantum many-body problems in physics and chemistry. Previous designs of hardware-efficient ansatz (HEA) on quantum computers are largely based on heuristics and lack rigorous theoretical foundations. In this work, we introduce a physics-constrained approach for designing HEA with rigorous theoretical guarantees by imposing a few fundamental constraints. Specifically, we require that the target HEA to be universal, systematically improvable, and size-consistent, which is an important concept in quantum many-body theories for scalability, but has been overlooked in previous designs of HEA. We extend the notion of size-consistency to HEA, and present a concrete realization of HEA that satisfies all these fundamental constraints while only requiring linear qubit connectivity. The developed physics-constrained HEA is superior to other heuristically designed HEA in terms of both accuracy and scalability, as demonstrated numerically for the Heisenberg model and some typical molecules. In particular, we find that restoring size-consistency can significantly reduce the number of layers needed to reach certain accuracy. In contrast, the failure of other HEA to satisfy these constraints severely limits their scalability to larger systems with more than ten qubits. Our work highlights the importance of incorporating physical constraints into the design of HEA for efficiently solving many-body problems on quantum computers.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Truncated Variational Hamiltonian Ansatz: efficient quantum circuit design for quantum chemistry and material science [0.0]
  This paper introduces the truncated Variational Hamiltonian Ansatz (tVHA), a novel circuit design for conducting quantum calculations on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>Our proposed ansatz significantly reduces the parameter count and can decrease circuit size substantially, with a trade-off in accuracy.<n>While this paper concentrates on the practical applications of tVHA in quantum chemistry, its underlying principles suggest a wider applicability extending to the broader field of material science computations on quantum computing platforms.
  arXiv  Detail & Related papers  (2025-05-26T09:54:46Z)
• Quantum Embedding of Non-local Quantum Many-body Interactions in Prototypal Anti-tumor Vaccine Metalloprotein on Near Term Quantum Computing Hardware [4.8962578963959675]
  We present for the first time a quantum computer model simulation of a complex hemocyanin molecule. Hemocyanin is an important respiratory protein involved in various physiological processes. We conclude that the magnetic structure of hemocyanin is largely influenced by the many-body correction.
  arXiv  Detail & Related papers  (2024-10-16T16:49:42Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• AQM: A Refresh of the Abstract Qubit Model for Quantum Computing Co-design [7.212252950717603]
  Qubits are the building blocks of quantum information science and applications. We introduce an abstract qubit model (AQM), offering a mathematical framework for higher-level algorithms and applications.
  arXiv  Detail & Related papers  (2024-03-17T20:19:17Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Assessing requirements to scale to practical quantum advantage [56.22441723982983]
  We develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required for large-scale quantum applications. We assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack.
  arXiv  Detail & Related papers  (2022-11-14T18:50:27Z)
• Toward Density Functional Theory on Quantum Computers? [0.0]
  Quantum Chemistry and Physics have been pinpointed as killer applications for quantum computers. We propose a counter-intuitive mapping from the non-interacting to an auxiliary interacting Hamiltonian that may provide the desired advantage.
  arXiv  Detail & Related papers  (2022-04-04T12:50:21Z)
• Gradient descent globally solves average-case non-resonant physical design problems [0.0]
  This paper addresses optimisation problems occurring in a wide variety of physical design problems, including but not limited to optical engineering, quantum control, structural engineering. The physics of the state of the system is often the question of the convergence globally optimal design.
  arXiv  Detail & Related papers  (2021-11-04T16:22:07Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• One-shot quantum error correction of classical and quantum information [10.957528713294874]
  Quantum error correction (QEC) is one of the central concepts in quantum information science. We provide a form of capacity theorem for both classical and quantum information. We show that a demonstration of QEC by short random quantum circuits is feasible.
  arXiv  Detail & Related papers  (2020-11-02T01:24:59Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.