Related papers: Calculation of Gibbs partition function with imagi…
We calculate the partition function for "composite particles". For any finite number of states d, and in the following two cases: 1)all states have the same energy, 2)the energy is linearly distributed over the states, we transform the…
We discuss an approach to determine averages of the work, dissipated heat and variation of internal energy of an open quantum system driven by an external classical field. These quantities are measured by coupling the quantum system to a…
Belief propagation -- a powerful heuristic method to solve inference problems involving a large number of random variables -- was recently generalized to quantum theory. Like its classical counterpart, this algorithm is exact on trees when…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
We outline a method to estimate the value of computation for a flexible algorithm using empirical data. To determine a reasonable trade-off between cost and value, we build an empirical model of the value obtained through computation, and…
Establishing an advantage for (white-box) computations by a quantum computer against its classical counterpart is currently a key goal for the quantum computation community. A quantum advantage is achieved once a certain computational…
Quantum computation requires coherently controlling the evolutions of qubits. Usually, these manipulations are implemented by precisely designing the durations (such as the $\pi$-pulses) of the Rabi oscillations and tunable interbit…
We show that quantum nondemolition (QND) measurements can be used to realize measurement-based imaginary time evolution. In our proposed scheme, repeated weak QND measurements are used to estimate the energy of a given Hamiltonian. Based on…
We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a Riemannian gradient flow on the special unitary group. This…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
The principle of teleportation can be used to perform a quantum computation even before its quantum input is defined. The basic idea is to perform the quantum computation at some earlier time with qubits which are part of an entangled…
In the current Noisy Intermediate-Scale Quantum era, noise is widely regarded as the primary obstacle to achieving fault-tolerant quantum computation. However, certain stages of the quantum computing pipeline can, in fact, benefit from this…
Quantum simulation on emerging quantum hardware is a topic of intense interest. While many studies focus on computing ground state properties or simulating unitary dynamics of closed systems, open quantum systems are an interesting target…
In this article, we propose a distributed quantum algorithm for solving counting problem using Grover operator and a classical post-processing procedure. We apply the proposed algorithm to estimate inner products and Hamming distances.…
We perform the first quantum computation of parton distribution function (PDF) with a real quantum device by calculating the PDF of the lightest positronium in the Schwinger model with IBM quantum computers. The calculation uses 10 qubits…
We investigate the capabilities of a quantum computer based on cold trapped ions in presence of non-dissipative decoherence. The latter is accounted by using the evolution time as a random variable and then averaging on a properly defined…
The preparation of quantum Gibbs states at finite temperatures is a cornerstone of quantum computation, enabling applications in quantum simulation of many-body systems, machine learning via quantum Boltzmann machines, and optimization…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
The computational modelling of reactions is simple in theory but can be quite tricky in practice. This article aims at the purpose of providing an assistance to a proper way of describing reactions theoretically and provides rough…
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…