Challenges and opportunities in quantum optimization
Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …
force classical simulation. Interest in quantum algorithms has developed in many areas …
Quantum-centric supercomputing for materials science: A perspective on challenges and future directions
Computational models are an essential tool for the design, characterization, and discovery
of novel materials. Computationally hard tasks in materials science stretch the limits of …
of novel materials. Computationally hard tasks in materials science stretch the limits of …
Variational benchmarks for quantum many-body problems
The continued development of computational approaches to many-body ground-state
problems in physics and chemistry calls for a consistent way to assess its overall progress …
problems in physics and chemistry calls for a consistent way to assess its overall progress …
Nuclear shell-model simulation in digital quantum computers
The nuclear shell model is one of the prime many-body methods to study the structure of
atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number …
atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number …
[PDF][PDF] Early fault-tolerant quantum computing
In recent years, research in quantum computing has largely focused on two approaches:
near-term intermediate-scale quantum (NISQ) computing and future fault-tolerant quantum …
near-term intermediate-scale quantum (NISQ) computing and future fault-tolerant quantum …
Quantum optimization: Potential, challenges, and the path forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
Hunting for quantum-classical crossover in condensed matter problems
The intensive pursuit for quantum advantage in terms of computational complexity has
further led to a modernized crucial question of when and how will quantum computers …
further led to a modernized crucial question of when and how will quantum computers …
Nearly optimal state preparation for quantum simulations of lattice gauge theories
We present several improvements to the recently developed ground-state preparation
algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU) …
algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU) …
Subspace methods for electronic structure simulations on quantum computers
Quantum subspace methods (QSMs) are a class of quantum computing algorithms where
the time-independent Schrödinger equation for a quantum system is projected onto a …
the time-independent Schrödinger equation for a quantum system is projected onto a …
Quantum simulations of fermionic hamiltonians with efficient encoding and ansatz schemes
We propose a computational protocol for quantum simulations of fermionic Hamiltonians on
a quantum computer, enabling calculations on spin defect systems which were previously …
a quantum computer, enabling calculations on spin defect systems which were previously …