Related papers: Resource-Optimized Fermionic Local-Hamiltonian Sim…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We propose a novel technique for optimizing a modular fault-tolerant quantum computing architecture, taking into account any desired space-time trade-offs between the number of physical qubits and the fault-tolerant execution time of a…
Quantum computers are expected to accelerate solving combinatorial optimization problems, including algorithms such as Grover adaptive search and quantum approximate optimization algorithm (QAOA). However, many combinatorial optimization…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
The study and prediction of chemical reactivity is one of the most important application areas of molecular quantum chemistry. Large-scale, fully error-tolerant quantum computers could provide exact or near-exact solutions to the underlying…
Quantum computers can be used to calculate the electronic structure and estimate the ground state energy of many-electron molecular systems. In the present study, we implement the Variational Quantum Eigensolver (VQE) algorithm, as a hybrid…
We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant quantum computers (EFTQCs) in the context of models of their implementations on a surface code architecture. We estimate the logical and physical…
Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that…
Progress in fault-tolerant quantum computation (FTQC) has driven the pursuit of practical applications with early fault-tolerant quantum computers (EFTQC). These devices, limited in their qubit counts and fault-tolerance capabilities,…
We study the Z3 gauge theory with fermions on the quantum computer using the Variational Quantum Eigensolver (VQE) algorithm with IBM QISKit software. Using up to 9 qubits we are able to obtain accurate results for the ground state energy.…
Digital quantum computers promise exponential speedups in performing quantum time-evolution, providing an opportunity to simulate quantum dynamics of complex systems in physics and chemistry. However, the task of extracting desired quantum…
Answering whether quantum computers can efficiently simulate quantum field theories has both theoretical and practical motivation. From the theoretical point of view, it answers the question of whether a hypothetical computer that utilizes…
Quantum harmonic oscillators, or qumodes, provide a promising and versatile framework for quantum computing. Unlike qubits, which are limited to two discrete levels, qumodes have an infinite-dimensional Hilbert space, making them…
The transformation of a molecular Hamiltonian from the fermionic space to the qubit space results in a series of Pauli strings. Calculating the energy then involves evaluating the expectation values of each of these strings, which presents…
Quantum phase estimation (QPE) serves as a building block of many different quantum algorithms and finds important applications in computational chemistry problems. Despite the rapid development of quantum hardware, experimental…
Noisy intermediate-scale quantum (NISQ) computers could solve quantum-mechanical simulation problems that are beyond the capabilities of classical computers. However, NISQ devices experience significant errors which, if not corrected, can…
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of…
As far as we know, a useful quantum computer will require fault-tolerant gates, and existing schemes demand a prohibitively large space and time overhead. We argue that a first generation quantum computer will be very valuable to design,…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…