Related papers: Generating Function in Quantum Mechanics: An Appli…
We present a brief survey of results where quantum information processing is useful to solve distributed computation tasks. We describe problems that are impossible to solve using classical resources but that become feasible with the help…
The relations between quantum coherence and quantum interference are discussed. A general method for generation of quantum coherence through interference-induced state selection is introduced and then applied to `simple' atomic systems…
Quantum generative modeling is emerging as a powerful tool for advancing data analysis in high-energy physics, where complex multivariate distributions are common. However, efficiently learning and sampling these distributions remains…
Measurement-based quantum computation (MBQC) offers a fundamentally unique paradigm to design quantum algorithms. Indeed, due to the inherent randomness of quantum measurements, the natural operations in MBQC are not deterministic and…
Parameterized quantum circuits have been extensively used as the basis for machine learning models in regression, classification, and generative tasks. For supervised learning, their expressivity has been thoroughly investigated and several…
Quantum computing is the process of performing calculations using quantum mechanics. This field studies the quantum behavior of certain subatomic particles for subsequent use in performing calculations, as well as for large-scale…
Quantum computing raises the possibility of solving a variety of problems in physics that are presently intractable. A number of such problems involves the physics of systems in or near thermal equilibrium. There are two main ways to…
Quantum and quantum-inspired machine learning has emerged as a promising and challenging research field due to the increased popularity of quantum computing, especially with near-term devices. Theoretical contributions point toward…
We describe a scheme for constructing quantum mechanics in which a quantum system is considered as a collection of open classical subsystems. This allows using the formal classical logic and classical probability theory in quantum…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Advances in photonics require photon-number resolved simulations of quantum optical experiments with Gaussian states. We demonstrate a simple and versatile method to simulate the photon statistics of general multimode Gaussian states. The…
A phase space mathematical formulation of quantum mechanical processes accompanied by and ontological interpretation is presented in an axiomatic form. The problem of quantum measurement, including that of quantum state filtering, is…
Test pattern generation is an electronic design automation tool that attempts to find an input (or test) sequence that, when applied to a digital circuit, enables one to distinguish between the correct circuit behavior and the faulty…
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.
We consider reversible work extraction from identical quantum batteries. From an ensemble of individually passive states, work can be produced only via global unitary (and thus entangling) operations. However, we show here that there always…
We develop an approach for building quantum models based on the exponentially growing orthonormal basis of Hartley kernel functions. First, we design a differentiable Hartley feature map parametrized by real-valued argument that enables…
Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in…
We derive generating functions for the ranks of pre-modular categories associated to quantum groups at roots of unity.
QCD equations for generating functionals are solved at coinciding momenta of particles. As a result, the relations for $q$-particle correlation functions at equal momenta are obtained. They are directly connected to previously derived…
We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…