Related papers: Recompilation-enhanced simulation of electron-phon…
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the simulation for two cases: (1) sequential quantum computers,…
Large-scale variational quantum algorithms are widely recognized as a potential pathway to achieve practical quantum advantages. However, the presence of quantum noise might suppress and undermine these advantages, which blurs the…
Accurate modeling of noise in realistic quantum processors is critical for constructing fault-tolerant quantum computers. While a full simulation of actual noisy quantum circuits provides information about correlated noise among all qubits…
Quantum Error Mitigation (QEM) enables the extraction of high-quality results from the presently-available noisy quantum computers. In this approach, the effect of the noise on observables of interest can be mitigated using multiple…
Running quantum circuits on quantum computers does not always generate "clean" results, unlike on a simulator, as noise plays a significant role in any quantum device. To explore this, we experimented with the Quantum Approximate…
Modeling composite systems of spins or electrons coupled to bosonic modes is of significant interest for many fields of applied quantum physics and chemistry. A quantum simulation can allow for the solution of quantum problems beyond…
Simulating open quantum systems on quantum computers presents a fundamental challenge: open quantum dynamics are intrinsically nonunitary, whereas quantum computers operate through unitary evolution. Conventional approaches overcome this…
This work aims to address the bottleneck issues of hardware resource limitation and decoherence error in the Hamiltonian simulation of quantum fluids, which are caused by the standard quantum Fourier transform and the evolution of momentum…
Fault-tolerant quantum computing is a promising tool for simulating molecules and materials, but frequently-considered applications require substantial resources, and the gap between hardware capabilities and requirements remains…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
Extracting the Hamiltonian of interacting quantum-information processing systems is a keystone problem in the realization of complex phenomena and large-scale quantum computers. The remarkable growth of the field increasingly requires…
We show that counting the number of collisions (re-sampled bitstrings) when measuring a random quantum circuit provides a practical benchmark for the quality of a quantum computer and a quantitative noise characterization method. We…
Quantum field theory (QFT) simulations are a potentially important application for noisy intermediate scale quantum (NISQ) computers. The ability of a quantum computer to emulate a QFT, therefore, constitutes a natural application-centric…
Simulations of quantum chemistry and quantum materials are believed to be among the most important potential applications of quantum information processors, but realizing practical quantum advantage for such problems is challenging. Here,…
We show a pulse-efficient circuit transpilation framework for noisy quantum hardware. This is achieved by scaling cross-resonance pulses and exposing each pulse as a gate to remove redundant single-qubit operations with the…
In recent years, there has been a significant progress in the development of digital quantum processors. The state-of-the-art quantum devices are imperfect, and fully-algorithmic fault-tolerant quantum computing is a matter of future. Until…
We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…
Digital quantum simulation is a promising application for quantum computers. Their free programmability provides the potential to simulate the unitary evolution of any many-body Hamiltonian with bounded spectrum by discretizing the time…
The complex-scaling method can be used to calculate molecular resonances within the Born-Oppenheimer approximation, assuming the electronic coordinates are dilated independently of the nuclear coordinates. With this method, one will…
In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit…