Related papers: The Quantum Trellis: A classical algorithm for sam…
One of the greatest challenges in quantum chromodynamics is understanding the hadronization mechanism, which is also crucial for carrying out precision physics with jet substructure. In this Letter, we combine recent advancements in our…
The simulation of molecules is a widely anticipated application of quantum computers. However, recent studies \cite{WBCH13a,HWBT14a} have cast a shadow on this hope by revealing that the complexity in gate count of such simulations…
The application of principles of Quantum Mechanics in areas outside of physics has been getting increasing attention in the scientific community in an emergent discipline called Quantum Cognition. These principles have been applied to…
Multimodal probability distributions are common in both quantum and classical systems, yet modeling them remains challenging when the number of modes is large or unknown. Classical methods such as mixture-density networks (MDNs) scale…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters and photodetectors. Our model enables us to simulate a quantum random walk with use of the wave nature of classical…
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g. the…
In quantum mechanics, wave functions and density matrices represent our knowledge about a quantum system and give probabilities for the outcomes of measurements. If the combined dynamics and measurements on a system lead to a density matrix…
This paper is devoted to such a fundamental problem of quantum computing as quantum parallelism. It is well known that quantum parallelism is the basis of the ability of quantum computer to perform in polynomial time computations performed…
The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…
Computing the state of a quantum mechanical many-body system composed of indistinguishable particles distributed over a multitude of modes is one of the paradigmatic test cases of computational complexity theory: Beyond well-understood…
In recent years, advanced deep neural networks have required a large number of parameters for training. Therefore, finding a method to reduce the number of parameters has become crucial for achieving efficient training. This work proposes a…
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expects quantum advantage. In this work, we present a highly…
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory…
A theoretical scheme, based on a probabilistic generalization of the Hamilton's principle, is elaborated to obtain an unified description of more general dynamical behaviors determined both from a lagrangian function and by mechanisms not…
This thesis explores hybrid algorithms that combine classical and quantum computing to enhance the performance of classical algorithms. Two approaches are studied: a hybrid search and sample optimization algorithm and a classical algorithm…
We propose a method to construct a classical analog of an open quantum system, namely a single quantum particle confined in a potential well and immersed in a thermal bath. The classical analog is made out of a collection of identical wells…
Recent astonishing experiments with quantum computers have demonstrated unambiguously the existence of a quantum multiverse, where calculations of mind-boggling complexity are effortlessly computed in just a few minutes. Here, we…
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…
Characterizing quantum processes is essential for unlocking the potential of quantum devices. However, standard quantum process tomography is resource-intensive and becomes infeasible on large-scale systems. Despite alternative approaches…