Related papers: Partition Function Estimation: Quantum and Quantum…
We develop an efficient and robust approach to Hamiltonian identification for multipartite quantum systems based on the method of compressed sensing. This work demonstrates that with only O(s log(d)) experimental configurations, consisting…
We present an encoding and hardware-independent formulation of optimization problems for quantum computing. Using this generalized approach, we present an extensive library of optimization problems and their various derived spin encodings.…
Based on the mapping between stabilizer quantum error correcting codes and disordered statistical mechanics models, we define a ratio of partition functions that measures the success probability for maximum partition function decoding,…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks. However, many studies rely on toy datasets or heavy feature reduction, raising concerns about their scalability.…
Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…
Variational quantum algorithms are a promising tool for solving partial differential equations. The standard approach for its numerical solution are finite difference schemes, which can be reduced to the linear algebra problem. We consider…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
Quantum algorithms for scientific computing and their applications have been studied actively. In this paper, we propose a quantum algorithm for estimating the first eigenvalue of a differential operator $\mathcal{L}$ on $\mathbb{R}^d$ and…
It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed…
A quantum thermodynamic system is described by a Hamiltonian and a list of conserved, non-commuting charges, and a fundamental goal is to determine the minimum energy of the system subject to constraints on the charges. Recently, [Liu et…
We propose a scheme for quantum computation in optical lattices. The qubits are encoded in the spacial wavefunction of the atoms such that spin decoherence does not influence the computation. Quantum operations are steered by shaking the…
We review some connections between quantum information and statistical mechanics. We focus on three sets of results for classical spin models. First, we show that the partition function of all classical spin models (including models in…
This paper explores the potential benefits of quantum coherence and quantum discord in the non-universal quantum computing model called deterministic quantum computing with one qubit (DQC1) in supervised machine learning. We show that the…
Variational quantum algorithms offer a promising framework for solving eigenvalue problems on near-term quantum hardware, yet their applicability beyond electronic structure calculations remains relatively unexplored. In this work, we…
The construction of good effective models is an essential part of understanding and simulating complex systems in many areas of science. It is a particular challenge for correlated many body quantum systems displaying emergent physics. We…
The key problem of statistical physics standing over one hundred years is how to exactly calculate the partition function (or free energy) of many-body interaction systems, which severely hinders application of the theory for realistic…
In this paper we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we…
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of…
We present a method to compute the Fermi function of the Hamiltonian for a system of independent fermions, based on an exact decomposition of the grand-canonical potential. This scheme does not rely on the localization of the orbitals and…