Related papers: Full-counting statistics of particle distribution …
A complete characterization of quantum fluctuations in many-body systems is accessible through the full counting statistics. We present an exact computation of statistical properties of light in a basic model of light-matter interaction: a…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
One of the potential applications of a quantum computer is solving quantum chemical systems. It is known that one of the fastest ways to obtain somewhat accurate solutions classically is to use approximations of density functional theory.…
The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…
New method is developed for calculation of single-particle occupation numbers in finite Fermi systems of interacting particles. It is more accurate than the canonical distribution method and gives the Fermi-Dirac distribution in the limit…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
The development of fault-tolerant quantum computers (FTQCs) is receiving increasing attention within the quantum computing community. Like conventional digital computers, FTQCs, which utilize error correction and millions of physical…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) connected through quantum communication links. In this paper, we have built a distributed quantum computing…
Quantum physics frequently involves a need to count the states, subspaces, measurement outcomes, and other elements of quantum dynamics. However, with quantum mechanics assigning probabilities to such objects, it is often desirable to work…
Performing quantum measurements produces not only the expectation value of a physical observable $O$ but also the probability distribution $P(o)$ of all possible outcomes $o$. The full counting statistics (FCS) $Z(\phi, O)\equiv \sum_o…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
We extend the ability of unitary quantum circuits by interfacing it with classical autoregressive neural networks. The combined model parametrizes a variational density matrix as a classical mixture of quantum pure states, where the…
Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation…
Machine learning techniques have led to broad adoption of a statistical model of computing. The statistical distributions natively available on quantum processors are a superset of those available classically. Harnessing this attribute has…
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over…
Modeling and reasoning about concurrent quantum systems is very important both for distributed quantum computing and for quantum protocol verification. As a consequence, a general framework describing formally the communication and…
We describe a plausible-speculative form of quantum computation which exploits particle (fermionic, bosonic) statistics, under a generalized, counterfactual interpretation thereof. In the idealized situation of an isolated system, it seems…
The ability to measure single quanta has allowed complete characterization of small quantum systems such as quantum dots in terms of statistics of detected signals known as full-counting statistics. Quantum gas microscopy enables one to…