English
Related papers

Related papers: Computing Ground State Properties with Early Fault…

200 papers

Key properties of physical systems can be described by the eigenvalues of matrices that represent the system. Computational algorithms that determine the eigenvalues of these matrices exist, but they generally suffer from a loss of…

Quantum Physics · Physics 2023-10-31 T. Powers , R. M. Rajapakse

Hybrid quantum-classical embedding methods for correlated materials simulations provide a path towards potential quantum advantage. However, the required quantum resources arising from the multi-band nature of $d$ and $f$ electron materials…

Quantum Physics · Physics 2023-01-09 Anirban Mukherjee , Noah F. Berthusen , João C. Getelina , Peter P. Orth , Yong-Xin Yao

Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the…

Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…

We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…

Quantum Physics · Physics 2024-08-27 Zhiyan Ding , Chi-Fang Chen , Lin Lin

The simulation of electronic properties is a pivotal issue in modern electronic structure theory, driving significant efforts over the past decades to develop protocols for computing energy derivatives. In this work, we address this problem…

Solving electronic structure problems is considered one of the most promising applications of quantum computing. However, due to limitations imposed by the coherence time of qubits in the Noisy Intermediate Scale Quantum (NISQ) era or the…

Quantum Physics · Physics 2025-03-20 Shuo Sun , Chandan Kumar , Kevin Shen , Elvira Shishenina , Christian B. Mendl

The simulation of the dynamics of a system coupled to a low-temperature environment is a promising application of quantum computers to determine ground-state properties of physical systems. However, this approach requires not only the…

Quantum Physics · Physics 2025-05-15 Tianren Wang , Zongkang Zhang , Bing-Nan Lu , Mauro Cirio , Ying Li

The use of quantum computers to calculate the ground state (lowest) energies of a spin lattice of electrons described by the Fermi-Hubbard model of great importance in condensed matter physics has been studied. The ability of quantum bits…

Computational Physics · Physics 2024-08-30 Adam Prokofiew , Nidhish Sharma , Steven Schnetzer

The quantum advantage threshold determines when a quantum processing unit (QPU) is more efficient with respect to classical computing hardware in terms of algorithmic complexity. The "green" quantum advantage threshold $-$ based on a…

Quantum Physics · Physics 2023-01-27 Daniel Jaschke , Simone Montangero

We examine a model of classical deterministic computing in which the ground state of the classical system is a spatial history of the computation. This model is relevant to quantum dot cellular automata as well as to recent universal…

Statistical Mechanics · Physics 2014-11-19 Elizabeth Crosson , Dave Bacon , Kenneth R. Brown

Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state…

Quantum Physics · Physics 2019-06-12 Suguru Endo , Tyson Jones , Sam McArdle , Xiao Yuan , Simon Benjamin

We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…

Quantum Physics · Physics 2015-03-17 Michael Siomau , Stephan Fritzsche

Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…

We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…

Quantum Physics · Physics 2025-04-17 Taehee Ko , Hyowon Park , Sangkook Choi

A new basis adaptive algorithm for hybrid quantum-classical platforms is introduced to efficiently find the ground-state (gs) properties of quantum many-body systems. The method addresses limitations of many algorithms, such as Variational…

Strongly Correlated Electrons · Physics 2025-12-16 Anutosh Biswas , Sayan Ghosh , Ritajit Majumdar , Mostafizur Rahaman , Manoranjan Kumar

The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to…

Variational hybrid quantum-classical algorithms are some of the most promising workloads for near-term quantum computers without error correction. The aim of these variational algorithms is to guide the quantum system to a target state that…

Quantum Physics · Physics 2021-03-18 Shavindra P. Premaratne , A. Y. Matsuura

The potential energy surface (PES) of molecules with respect to their nuclear positions is a primary tool in understanding chemical reactions from first principles. However, obtaining this information is complicated by the fact that…

Ground state counting plays an important role in several applications in science and engineering, from estimating residual entropy in physical systems, to bounding engineering reliability and solving combinatorial counting problems. While…

‹ Prev 1 4 5 6 7 8 10 Next ›