Related papers: Leveraging commuting groups for an efficient varia…
Over the last century, a large number of physical and mathematical developments paired with rapidly advancing technology have allowed the field of quantum chemistry to advance dramatically. However, the lack of computationally efficient…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
We solve the nuclear two-body and three-body bound states via quantum simulations of pionless effective field theory on a lattice in position space. While the employed lattice remains small, the usage of local Hamiltonians including two-…
Several linear algebra routines for quantum computing use a basis of tensor products of identity and Pauli operators to describe linear operators, and obtaining the coordinates for any given linear operator from its matrix representation…
The opportunities afforded by near-term quantum computers to calculate the ground-state properties of small molecules depend on the structure of the computational ansatz as well as the errors induced by device noise. Here we investigate the…
Given a Hamiltonian that is a sum of commuting few-body terms, the commuting Hamiltonian problem is to determine if there exists a quantum state that is the simultaneous eigenstate of all of these terms that minimizes each term…
The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates…
The simulation of chemistry is among the most promising applications of quantum computing. However, most prior work exploring algorithms for block-encoding, time-evolving, and sampling in the eigenbasis of electronic structure Hamiltonians…
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…
We report a quantum simulation of the deuteron binding energy on quantum processors accessed via cloud servers. We use a Hamiltonian from pionless effective field theory at leading order. We design a low-depth version of the unitary…
In this work, we combine the recently developed double unitary coupled cluster (DUCC) theory with the adaptive, problem-tailored variational quantum eigensolver (ADAPT-VQE) to explore accuracy of unitary downfolded Hamiltonians for quantum…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
As quantum devices continue to grow in size but remain affected by noise, it is crucial to determine when and how they can outperform classical computers on practical tasks. A central piece in this effort is to develop the most efficient…
In this paper, we design quantum circuits for the exponential of scaled $n$-qubit Pauli strings using single-qubit rotation gates, Hadamard gate, and CNOT gates. A key result we derive is that any two Pauli-string operators composed of…
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we consider "space-like cuts" where an entangling unitary is…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
The circuit-to-Hamiltonian construction has found widespread use within the field of Hamiltonian complexity, particularly for proving QMA-hardness results. In this work we examine the ground state energies of the Hamiltonian for standard…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
Introducing an active space approximation is inevitable for the quantum computations of chemical systems. However, this approximation ignores the electron correlations related to non-active orbitals. Here, we propose a computational method…
Measuring quantum observables by grouping terms that can be rotated to sums of only products of Pauli $\hat z$ operators (Ising form) is proven to be efficient in near term quantum computing algorithms. This approach requires extra unitary…