Related papers: Quantum Belief Propagation
The belief propagation (BP) algorithm is an efficient way to solve "inference" problems in graphical models, such as Bayesian networks and Markov random fields. The system-state probability distribution of CSMA wireless networks is a Markov…
Heat transfer involving phase change is computationally intensive due to moving phase boundaries, nonlinear computations, and time step restrictions. This paper presents a quantum lattice Boltzmann method (QLBM) for simulating heat transfer…
In this paper we study a model of a Quantum Branching Program (QBP) and investigate its computational power. We prove a general lower bound on the width of read-once QBPs, which we show to be almost tight on certain symmetric function.
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
Temperature is a deceptively simple concept that still raises deep questions at the forefront of quantum physics research. The observation of thermalisation in completely isolated quantum systems, such as cold-atom quantum simulators,…
The main objective of quantum simulation is an in-depth understanding of many-body physics. It is important for fundamental issues (quantum phase transitions, transport, . . . ) and for the development of innovative materials. Analytic…
Quantum computing has shown great potential in various quantum chemical applications such as drug discovery, material design, and catalyst optimization. Although significant progress has been made in quantum simulation of simple molecules,…
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…
Belief propagation with quantum messages (BPQM) provides a low-complexity alternative to collective measurements for communication over classical--quantum channels. Prior BPQM constructions and density-evolution (DE) analyses have focused…
A conventional quantum phase transition (QPT) occurs not only at zero temperature, but also exhibits finite-temperature quantum criticality. Motivated by the discovery of the pseudo-Hermiticity of non-Hermitian systems, we explore the…
We describe a novel approach to statistical learning from particles tracked while moving in a random environment. The problem consists in inferring properties of the environment from recorded snapshots. We consider here the case of a fluid…
We comparatively study three of the most useful quantum information tools to detect quantum critical points (QCPs) when only finite temperature data are available. We investigate quantitatively how the quantum discord, the quantum…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
Coherence is an inherently quantum property that deeply affects microscopic processes, including thermalization phenomena. A striking example is the quantum Mpemba effect (QME), in which a system can exhibit anomalous relaxation,…
Understanding and predicting the properties of solid-state materials from first-principles has been a great challenge for decades. Owing to the recent advances in quantum technologies, quantum computations offer a promising way to achieve…
Experimentally realizable quantum computers are rapidly approaching the threshold of quantum supremacy. Quantum Hamiltonian simulation promises to be one of the first practical applications for which such a device could demonstrate an…
In this paper we show how to measure in the setting of digital quantum simulations the reflection and transmission amplitudes of the one-dimensional scattering of a particle with a short-ranged potential. The main feature of the protocol is…
Belief Propagation is a well-studied message-passing algorithm that runs over graphical models and can be used for approximate inference and approximation of local marginals. The resulting approximations are equivalent to the Bethe-Peierls…