Related papers: Exploiting Particle Statistics in Quantum Computat…

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…

In contrast to classical physics, quantum mechanics divides particles into two classes-bosons and fermions-whose exchange statistics dictate the dynamics of systems at a fundamental level. In two dimensions quasi-particles known as 'anyons'…

Quantum computational models can be approached via the lens of resources needed to perform computational tasks, where a computational advantage is achieved by consuming specific forms of quantum resources, or, conversely, resource-free…

The Bohmian formulation of quantum mechanics is used in order to describe the measurement process in an intuitive way without a reduction postulate in the framework of a deterministic single system theory. Thereby the motion of the hidden…

In this didactical note I review in depth the rationale for using generalised canonical distributions in quantum statistics. Particular attention is paid to the proper definitions of quantum entropy and quantum relative entropy, as well as…

We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational…

Basic concepts of quantum theory of information, principles of quantum calculations and the possibility of creation on this basis unique on calculation power and functioning principle device, named quantum computer, are briefly reviewed.…

In this thesis, I present several results on quantum statistical inference in the following two directions. Firstly, I demonstrate that quantum algorithms can be applied to enhance the computing and training of Gaussian processes (GPs), a…

We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…

A nonparametric Bayesian approach is developed to determine quantum potentials from empirical data for quantum systems at finite temperature. The approach combines the likelihood model of quantum mechanics with a priori information over…

In three spatial dimensions, particles are limited to either bosonic or fermionic statistics. Two-dimensional systems, on the other hand, can support anyonic quasiparticles exhibiting richer statistical behaviours. An exciting proposal for…

We analyze here in details the probability to find a given number of particles in a finite volume inside a normal or superfluid finite system. This probability, also known as counting statistics, is obtained using projection operator…

We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…

We propose the implementation of a switch of particle statistics with an embedding quantum simulator. By encoding both Bose-Einstein and Fermi-Dirac statistics into an enlarged Hilbert space, the statistics of quantum particles may be…

A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically…

Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…

Systems of spin 1, such as triplet pairs of spin-1/2 fermions (like orthohydrogen nuclei) make useful three-terminal elements for quantum computation, and when interconnected by qubit equality relations are universal for quantum…

We consider an example of a quantum algorithm from the point of view of the de Broglie-Bohm formulation of quantum mechanics. For concreteness we look at two particular implementations: one using spin-1/2 particles as described by a simple…

The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…

We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…