Related papers: Low Depth Unitary Coupled Cluster Algorithm for La…
The recent advent of commercially available quantum annealing hardware (QAH) has expanded opportunities for research into quantum annealing-based algorithms. In the domain of power systems, this advancement has driven increased interest in…
One of the most challenging problems for the realization of a scalable quantum computer is to design a physical device that keeps the error rate for each quantum processing operation low. These errors can originate from the accuracy of…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
We assess the performance of the Quantum Flow (QFlow) algorithm employing cost-effective solvers based on the unitary coupled-cluster ansatz with single and double excitations (QFlow-SD). The resulting energies are benchmarked against those…
Multicomponent systems are defined as chemical systems that require a quantum mechanical description of two or more different types of particles. Non-Born-Oppenheimer electron-nuclear interactions in molecules, electron-hole interactions in…
Quantum circuit equivalence checking asks whether two circuits implement the same unitary. It guarantees compiler correctness and safe optimization, yet most existing approaches scale exponentially with the number of qubits or the circuit…
This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's…
Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…
Variational quantum algorithms are promising applications of noisy intermediate-scale quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and-measure experiments that estimate terms in a Hamiltonian. The…
Heavy atom compounds represent a challenge for computational chemistry, due to the need for simultaneous treatment of relativistic and correlation effects. Often such systems exhibit also strong correlation which hampers the application of…
We present quantum algorithms, for Hamiltonians of linear combinations of local unitary operators, for Hamiltonian matrix-vector products and for preconditioning with the inverse of shifted reduced Hamiltonian operator that contributes to…
Despite advances in the development of quantum computers, the practical application of quantum algorithms requiring deep circuit depths or high-fidelity transformations remains outside the current range of the so-called noisy…
A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been…
Quantum circuit depth minimization is critical for practical applications of circuit-based quantum computation. In this work, we present a systematic procedure to decompose multiqubit controlled unitary gates, which is essential in many…
Quantum chemistry is a promising application of future quantum computers, but the requirements on qubit count and other resources suggest that modular computing architectures will be required. We introduce an implementation of a quantum…
The quantum hybrid algorithm has become a very promising and speedily method today for solving the larger-scale optimization in the noisy intermediate-scale quantum (NISQ) era. The unit commitment (UC) problem is a fundamental problem in…
The variational quantum eigensolver (VQE) is one of the most promising algorithms to find eigenvalues and eigenvectors of a given Hamiltonian on noisy intermediate-scale quantum (NISQ) devices. A particular application is to obtain ground…
The discovery of causal relations from observed data has attracted significant interest from disciplines such as economics, social sciences, and biology. In practical applications, considerable knowledge of the underlying systems is often…
One of the fundamental conditions for one-way quantum computation (1WQC) is the ability to make sequential measurements on isolated qubits that comprise the highly entangled resource for 1WQC, the cluster state. This has been a significant…
Near-term quantum devices require wavefunction ans\"atze that are expressive while also of shallow circuit depth in order to both accurately and efficiently simulate molecular electronic structure. While unitary coupled cluster (e.g.,…