Related papers: Hybrid quantum-classical approach for coupled-clus…
Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates…
The variational quantum eigensolver (VQE) is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. This hybrid quantum/classical algorithm involves implementing a sequence of…
We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems, with a focus on molecular systems. The method combines classical preparation of a perturbed…
In this study, we propose a quantum-classical hybrid scheme for performing orbital-free density functional theory (OFDFT) using probabilistic imaginary-time evolution (PITE), designed for the era of fault-tolerant quantum computers (FTQC),…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
The initialization of quantum states or Quantum State Preparation (QSP) is a basic subroutine in quantum algorithms. In the worst case, general QSP algorithms are expensive due to the application of multi-controlled gates required to build…
Interacting spin systems in solids underpin a wide range of quantum technologies, from quantum sensors and single-photon sources to spin-defect-based quantum registers and processors. We develop a quantum-computer-aided framework for…
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…
This paper presents a hybrid quantum-classical machine learning model for classification tasks, integrating a 4-qubit quantum circuit with a classical neural network. The quantum circuit is designed to encode the features of the Iris…
We derive equations of motion for Green's functions of the multi-orbital Anderson impurity model by differentiating symmetrically with respect to all time arguments. The resulting equations relate the one- and two-particle Green's function…
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…
A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over…
The coherent superposition of non-orthogonal fermionic Gaussian states has been shown to be an efficient approximation to the ground states of quantum impurity problems [Bravyi and Gosset,Comm. Math. Phys.,356 451 (2017)]. We present a…
Quantum simulation can help us study poorly understood topics such as high-temperature superconductivity and drug design. However, existing quantum simulation algorithms for current quantum computers often have drawbacks that impede their…
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine…
We present an efficient ab initio dynamical mean-field theory (DMFT) implementation for quantitative simulations in solids. Our DMFT scheme employs ab initio Hamiltonians defined for impurities comprising the full unit cell or a supercell…
The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
Molecular ground-state simulation is one of the most promising fields for demonstrating practical quantum advantage on near-term quantum computers. However, the Variational Quantum Eigensolver (VQE), a leading algorithm for this task, still…
We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a…