Related papers: Non-Clifford diagonalization for measurement shot …
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
Solving the electronic structure problem using the Variational Quantum Eigensolver (VQE) technique involves measurement of the Hamiltonian expectation value. Current hardware can perform only projective single-qubit measurements, and thus,…
We make the case that variational algorithm ansatzes for near-term quantum computing are well-suited for the quantum circuit cutting strategy. Previous demonstrations of circuit cutting focused on the exponential execution and…
Quantum optimization as a field has largely been restricted by the constraints of current quantum computing hardware, as limitations on size, performance, and fidelity mean most non-trivial problem instances won't fit on quantum devices.…
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…
Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware. The standard approaches to optimizing these circuits rely on a classical system to compute the new…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algorithm for efficiently learning a large set of non-commuting…
Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…
Quantum measurements are our eyes to the quantum systems consisting of a multitude of microscopic degrees of freedom. However, the intrinsic uncertainty of quantum measurements and the exponentially large Hilbert space pose natural barriers…
Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters,…
In this study we present an optimization method based on the quantum Monte Carlo diagonalization for many-fermion systems. Using the Hubbard-Stratonovich transformation, employed to decompose the interactions in terms of auxiliary fields,…
We propose an efficient and almost optimal scheme for measuring molecular Hamiltonians in quantum chemistry on quantum computers, which requires $2N^2$ distinct measurements in the leading order with $N$ being the number of molecular…
This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process…
The Hamiltonian operator plays a central role in quantum theory being a generator of unitary quantum dynamics. Its expectation value describes the energy of a quantum system. Typically being a non-unitary operator, the action of the…
The reduction of Hamiltonian systems aims to build smaller reduced models, valid over a certain range of time and parameters, in order to reduce computing time. By maintaining the Hamiltonian structure in the reduced model, certain…
Graphical models are useful tools for describing structured high-dimensional probability distributions. Development of efficient algorithms for generating unbiased and independent samples from graphical models remains an active research…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…
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…
Circuit cutting is a promising technique that leverages both quantum and classical computational resources, enabling the practical execution of large quantum circuits on noisy intermediate-scale quantum (NISQ) hardware. Recent approaches…