Related papers: Gauge-Fixing Quantum Density Operators At Scale
We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we…
Non-unitary theories are commonly seen in the classical simulations of quantum systems. Among these theories, the method of moments of coupled-cluster equations (MMCCs) and the ensuing classes of the renormalized coupled-cluster (CC)…
Using the tensor product representation in the density matrix renormalization group, we show that a quantum circuit of Grover's algorithm, which has one-qubit unitary gates, generalized Toffoli gates, and projective measurements, can be…
Quantum computing is finding promising applications in optimization, machine learning and physics, leading to the development of various models for representing quantum information. Because these representations are often studied in…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…
We study the properties of a non-Gaussian density matrix for a O(N) scalar field in the context of the incomplete description picture. This is of relevance for studies of decoherence and entropy production in quantum field theory. In…
The quantum dense output problem is the process of evaluating time-accumulated observables from time-dependent quantum dynamics using quantum computers. This problem arises frequently in applications such as quantum control and…
Quantum computing has made remarkable strides in recent years, as demonstrated by quantum supremacy experiments and the realization of high-fidelity, fault-tolerant gates. However, a major obstacle persists: practical real-world…
Determining ground state energies of quantum systems by hybrid classical/quantum methods has emerged as a promising candidate application for near-term quantum computational resources. Short of large-scale fault-tolerant quantum computers,…
We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed…
Quantum systems out of equilibrium are presently a subject of active research, both in theoretical and experimental domains. In this work we consider time-periodically modulated quantum systems which are in contact with a stationary…
While general quantum many-body systems require exponential resources to be simulated on a classical computer, systems of non-interacting fermions can be simulated exactly using polynomially scaling resources. Such systems may be of…
We demonstrate the implementation of a novel machine learning framework for probability density estimation and classification using quantum circuits. The framework maps a training data set or a single data sample to the quantum state of a…
Accurate modeling of quantum systems interacting with environments requires addressing non-unitary dynamics, which significantly complicates computational approaches. In this work, we enhance an open quantum system (OQS) theory using…
We present a new approach to the study of equilibrium properties in many-body quantum physics. Our method takes inspiration from Density Matrix Quantum Monte Carlo and incorporates new crucial features. First of all, the dynamics is…
Generalized measurement schemes on one part of bipartite states, which would leave the set of all separable states insensitive are explored here to understand quantumness of correlations in a more general perspecitve. This is done by…
This article presents a concrete mathematical framework for the generation of entangled quantum states from classical stochastic processes. We demonstrate that any density operator $\rho_{AB}$ of a composite system can be derived from the…
The relation between entanglement entropy and the computational difficulty of classically simulating Quantum Mechanics is briefly reviewed. Matrix product states are proven to provide an efficient representation of one-dimensional quantum…
In a previous paper, a project of constructing quantum models of classical properties has been started. The present paper concludes the project by turning to classical mechanics. The quantum states that maximize entropy for given averages…
Expectation values of measurement operators, interpreted as measurement probabilities, arise frequently throughout quantum algorithms. When quantum states are randomly distributed, their expectation values are also randomly distributed. In…