Related papers: Resource Requirements for Fault-Tolerant Quantum S…
Understanding the physics of strongly correlated materials is one of the grand challenge problems for physics today. A large class of scientifically interesting materials, from high-$T_c$ superconductors to spin liquids, involve medium to…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
In this paper, we use open-source tools to perform quantum resource estimation to assess the requirements for industry-relevant quantum computation. Our analysis uses the problem of industrial shift scheduling in manufacturing and the…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
Quantum random-access look-up of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation…
Variational quantum algorithms are practical approaches to prepare ground states, but their potential for quantum advantage remains unclear. Here, we use differentiable 2D tensor networks (TN) to optimize parameterized quantum circuits that…
As the advances in quantum hardware bring us into the noisy intermediate-scale quantum (NISQ) era, one possible task we can perform without quantum error correction using NISQ machines is the variational quantum eigensolver (VQE) due to its…
The accurate computation of properties of large molecular systems is classically infeasible and is one of the applications in which it is hoped that quantum computers will demonstrate an advantage over classical devices. However, due to the…
We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain. The order parameter only collapses on one side of the…
Fault-tolerant quantum computation enables reliable quantum computation but incurs a significant overhead from both time and resource perspectives. To reduce computation time, Austin G. Fowler proposed time-optimal quantum computation by…
The resource estimation tools provided by Azure Quantum and Azure Quantum Development Kit are described. Using these tools one can automatically evaluate the logical and physical resources required to run algorithms on fault-tolerant…
The transport of conserved quantities like spin and charge is fundamental to characterizing the behavior of quantum many-body systems. Numerically simulating such dynamics is generically challenging, which motivates the consideration of…
Although quantum mechanics underpins the microscopic behavior of all materials, its effects are often obscured at the macroscopic level by thermal fluctuations. A notable exception is a zero-temperature phase transition, where scaling laws…
Quantum computers are an ideal platform to study the ground state properties of strongly correlated systems due to the limitation of classical computing techniques particularly for systems exhibiting quantum phase transitions. While the…
We evaluate strategies for reducing the run time of fault-tolerant quantum computations, targeting practical utility in scientific or industrial workflows. Delivering a technology with broad impact requires scaling devices, while also…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
Despite significant progress in quantum computing in recent years, executing quantum circuits for practical problems remains challenging due to error-prone quantum hardware. Hence, quantum error correction becomes essential but induces…
Neutral atom arrays have recently emerged as a promising platform for fault-tolerant quantum computing. Based on these advances, including dynamically-reconfigurable connectivity and fast transversal operations, we present a low-overhead…