Related papers: Energy, Bosons and Computational Complexity
In theory, quantum computers can efficiently simulate quantum physics, factor large numbers and estimate integrals, thus solving otherwise intractable computational problems. In practice, quantum computers must operate with noisy devices…
We present a method to systematically identify and classify quantum optical non-classical states as classical/non-classical based on the resources they create on a bosonic quantum computer. This is achieved by converting arbitrary bosonic…
Since its introduction Boson Sampling has been the subject of intense study in the world of quantum computing. The task is to sample independently from the set of all $n \times n$ submatrices built from possibly repeated rows of a larger $m…
We conjecture a chaos energy bound, an upper bound on the energy dependence of the Lyapunov exponent for any classical/quantum Hamiltonian mechanics and field theories. The conjecture states that the Lyapunov exponent $\lambda(E)$ grows no…
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computational task. Despite this promise, existing proposals and…
Computing circuits composed of noisy logical gates and their ability to represent arbitrary Boolean functions with a given level of error are investigated within a statistical mechanics setting. Bounds on their performance, derived in the…
We show that the time dependence of mean value of a physical quantity is related with the transition energies of a quantum system. In the case when the operator of a physical quantity anticommutes with the Hamiltonian of a system, studies…
The previously proposed Heisenberg-type relation $ E_c t_c >> \hbar {\cal C}$ for the energy used by a quantum computer, the total computation time and the logical ("classical") complexity of the problem is verified for the following…
We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set $A$ of integers may be written as $A = B \cup C$, where $B$ and $C$ are disjoint sets satisfying \[ |\{ (b_1, \dots, b_{2s}) \in…
Energy-efficient computing is becoming increasingly important in the information era. However, electronic computers with von Neumann architecture can hardly meet the challenge due to the inevitable energy-intensive data movement, especially…
BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the…
Probabilistic computing excels in approximating combinatorial problems and modelling uncertainty. However, using conventional deterministic hardware for probabilistic models is challenging: (pseudo) random number generation introduces…
Robustly estimating energy consumption in High-Performance Computing (HPC) is essential for assessing the energy footprint of modern workloads, particularly in fields such as Artificial Intelligence (AI) research, development, and…
In this paper we calculate kinetic, potential and full energy with three- and four-particle direct correlations taken into account at wide temperature region on the base of the density matrix of the interacting Bose-particles [I. O.…
An exactly solved bosonic tunneling model is studied along a line of the coupling parameter space, which includes a quantum phase boundary line. The entire energy spectrum is computed analytically, and found to exhibit multiple energy level…
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,…
Bosonic continuous-variable Variational quantum circuits (VQCs) are crucial for information processing in cavity quantum electrodynamics and optical systems, widely applicable in quantum communication, sensing and error correction. The…
Quantum advantage, benchmarking the computational power of quantum machines outperforming all classical computers in a specific task, represents a crucial milestone in developing quantum computers and has been driving different physical…