Related papers: Efficient simulation of quantum chemistry problems…
We develop randomized quantum algorithms to simulate quantum collision models, also known as repeated interaction schemes, which provide a rich framework to model various open-system dynamics. The underlying technique involves composing…
We significantly enhance the simulation accuracy of initial Trotter circuits for Hamiltonian simulation of quantum systems by integrating first-order Riemannian optimization with tensor network methods. Unlike previous approaches, our…
In this work, we investigate the capability of known quantum-computing algorithms for fault-tolerant quantum computing to simulate the laser-driven electron dynamics in small molecules such as lithium hydride. These computations are…
The implementation and practicality of quantum algorithms highly hinge on the quality of operations within a quantum processor. Therefore, including realistic error models in quantum computing simulation platforms is crucial for testing…
Accurate simulation of dynamical processes in molecules and reactions is among the most challenging problems in quantum chemistry. Quantum computers promise efficient chemical simulation, but the existing quantum algorithms require many…
In a recent milestone experiment, Google's processor Sycamore heralded the era of "quantum supremacy" by sampling from the output of (pseudo-)random circuits. We show that such random circuits provide tailor-made building blocks for…
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved…
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a bosonic system of qubits. By exploiting the block diagonality of a fermionic Hamiltonian, we show that the number of…
We describe a method to simulate Hamiltonian evolution on a quantum computer by repeatedly using a superposition of steps of a quantum walk, then applying a correction to the weightings for the numbers of steps of the quantum walk. This…
Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work…
Quantum computing has recently exhibited great potentials in predicting chemical properties for various applications in drug discovery, material design, and catalyst optimization. Progress has been made in simulating small molecules, such…
Although the simulation of quantum chemistry is one of the most anticipated applications of quantum computing, the scaling of known upper bounds on the complexity of these algorithms is daunting. Prior work has bounded errors due to…
We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and…
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…
Quantum algorithms have the potential to revolutionize our understanding of open quantum systems in chemistry. In this work, we demonstrate that a repeated interaction model, which could serve as the foundation for a digital quantum…
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational…
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…
Quantum simulation promises to address many challenges in fields ranging from quantum chemistry to material science, and high-energy physics, and could be implemented in noisy intermediate-scale quantum devices. A challenge in building good…
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial…