Related papers: Classical simulation of lossy boson sampling using…
Simulating the dynamics of many-body quantum systems is believed to be one of the first fields that quantum computers can show a quantum advantage over classical computers. Noisy intermediate-scale quantum (NISQ) algorithms aim at…
Gaussian boson sampling (GBS) is a variety of boson sampling overcoming the stable single-photon preparation difficulty of the later. However, like those in the original version, noises in GBS will also result in the deviation of output…
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 simulation complexity of predicting the time evolution of delocalized many-body quantum systems has attracted much recent interest, and simulations of such systems in real quantum hardware are promising routes to demonstrating a quantum…
Gaussian boson sampling is originally proposed to show quantum advantage with quantum linear optical elements. Recently, several experimental breakthroughs based on Gaussian boson sampling pointing to quantum computing supremacy have been…
The present era of quantum processors with hundreds to thousands of noisy qubits has sparked interest in understanding the computational power of these devices and how to leverage it to solve practically relevant problems. For applications…
Verification of a quantum advantage in the presence of noise is a key open problem in the study of near-term quantum devices. In this work, we show how to assess the quality of photonic interference in a linear optical quantum device (boson…
We propose a new method to efficiently compute the entanglement entropy (EE) of quantum many-body systems. Our approach, called the incremental SWAP operator method , combines the simplicity of the SWAP operator used in projector quantum…
There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the…
Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287…
It is important to know noise levels of boson sampling in order to cautiously demonstrate the quantum computational advantage or realize certain tasks. Based on those statistical benchmark methods such as the correlators and clouds, which…
Boson Sampling is the problem of sampling from the same output probability distribution as a collection of indistinguishable single photons input into a linear interferometer. It has been shown that, subject to certain computational…
Noisy quantum simulation is challenging since one has to take into account the stochastic nature of the process. The dominating method for it is the density matrix approach. In this paper, we evaluate conditions for which this method is…
The Poisson equation has wide applications in many areas of science and engineering. Although there are some quantum algorithms that can efficiently solve the Poisson equation, they generally require a fault-tolerant quantum computer which…
Sampling from probability distributions of quantum circuits is a fundamentally and practically important task which can be used to demonstrate quantum supremacy using noisy intermediate-scale quantum devices. In the present work, we examine…
Boson sampling is a mathematical problem that is strongly believed to be intractable for classical computers, whereas passive linear interferometers can produce samples efficiently. So far, the problem remains a computational curiosity, and…
A universal fault-tolerant quantum computer holds the promise to speed up computational problems that are otherwise intractable on classical computers; however, for the next decade or so, our access is restricted to noisy intermediate-scale…
We present methods which allow orders of magnitude increase in the number of modes in linear optics experiments by moving from spatial encoding to temporal encoding and using dispersion. This enables significant practical advantages for…
Quantum computation has been growing rapidly in both theory and experiments. In particular, quantum computing devices with a large number of qubits have been developed by IBM, Google, IonQ, and others. The current quantum computing devices…
Quantum trajectories and superoperator algorithms implemented within the matrix product state (MPS) framework are powerful tools to simulate the real-time dynamics of open dissipative quantum systems. As for the unitary case, the reachable…