Related papers: Bosonic Quantum Computational Complexity
We study a special kind of semiclassical limit of quantum dynamics on a circle and in a box (infinite potential well with hard walls) as the Planck constant tends to zero and time tends to infinity. The results give detailed information…
A broad spectrum of physical systems in condensed-matter and high-energy physics, vibrational spectroscopy, and circuit and cavity QED necessitates the incorporation of bosonic degrees of freedom, such as phonons, photons, and gluons, into…
We derive the effective Hamiltonian for a quantum system constrained to a submanifold (the constraint manifold) of configuration space (the ambient space) in the asymptotic limit where the restoring forces tend to infinity. In contrast to…
Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes. In this work, we present the first time-efficient…
Gaussian boson sampling is a model of photonic quantum computing that has attracted attention as a platform for building quantum devices capable of performing tasks that are out of reach for classical devices. There is therefore significant…
The old cosmological-constant (CC) problem indicates an inconsistency of the usual formulation of semiclassical gravity. The usual formulation of semiclassical gravity also seems to be inconsistent with the conventional interpretation of…
The partition function and free energy of a quantum many-body system determine its physical properties in thermal equilibrium. Here we study the computational complexity of approximating these quantities for $n$-qubit local Hamiltonians.…
A natural formulation of the theory of quantum measurements in continuous time is based on quantum stochastic differential equations (Hudson-Parthasarathy equations). However, such a theory was developed only in the case of…
Two major deviations from causality in the existing formulations of quantum mechanics, related respectively to quantum chaos and indeterminate wave reduction, are eliminated within the new, universal concept of dynamic complexity. The…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
For certain restricted computational tasks, quantum mechanics provides a provable advantage over any possible classical implementation. Several of these results have been proven using the framework of measurement-based quantum computation…
We introduce a new family of quantum circuits in Continuous Variables and we show that, relying on the widely accepted conjecture that the polynomial hierarchy of complexity classes does not collapse, their output probability distribution…
We introduce a unified framework -- Quantum Neural Ordinary and Partial Differential Equations (QNODEs and QNPDEs) -- which extends the continuous-time formalism of classical neural ordinary and partial differential equations into quantum…
Product states, unentangled tensor products of single qubits, are a ubiquitous ansatz in quantum computation, including for state-of-the-art Hamiltonian approximation algorithms. A natural question is whether we should expect to efficiently…
The quantum theory of the electromagnetic field enables the description of multiphoton states exhibiting nonclassical statistical properties, often reflected in non-Gaussian phase-space distributions. While non-Gaussianity alone does not…
Quantum circuits that are classically simulatable tell us when quantum computation becomes less powerful than or equivalent to classical computation. Such classically simulatable circuits are of importance because they illustrate what makes…
We develop a method to determine the eigenvalues and eigenfunctions of two-boson Hamiltonians include a wide class of quantum optical models. The quantum Hamiltonians have been transformed in the form of the one variable differential…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
We prove several new results concerning the pure quantum polynomial hierarchy (pureQPH). First, we show that QMA(2) is contained in pureQSigma2, that is, two unentangled existential provers can be simulated by competing existential and…