Related papers: Spin models and boson sampling

Since the dawn of quantum computation science, a range of quantum algorithms have been proposed, yet few have experimentally demonstrated a definitive quantum advantage. Shor's algorithm, while renowned, has not been realized at a scale to…

We study the complexity of classically sampling from the output distribution of an Ising spin model, which can be implemented naturally in a variety of atomic, molecular, and optical systems. In particular, we construct a specific example…

IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. For time-independent systems with fewer than three spins, we compute the exact time evolution at arbitrary times and measure spin…

We develop an alternative boson sampling model operating on single-photon states followed by linear interferometry and Gaussian measurements. The hardness proof for simulating such continuous-variable measurements is established in two main…

We make the case for studying the complexity of approximately simulating (sampling) quantum systems for reasons beyond that of quantum computational supremacy, such as diagnosing phase transitions. We consider the sampling complexity as a…

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…

Boson sampling can simulate physical problems for which classical simulations are inefficient. However, not all problems simulated by boson sampling are classically intractable. We consider a situation in which it is known that the outcome…

The global coupling of few-level quantum systems ("spins") to a discrete set of bosonic modes is a key ingredient for many applications in quantum science, including large-scale entanglement generation, quantum simulation of the dynamics of…

A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the…

We study the full time evolution of one- and two-mode bosonic quantum systems that interact through single- and two-mode squeezing Hamiltonians. We establish that the single- and two-mode cases are formally equivalent, leading to the same…

Boson sampling has emerged as an important tool to demonstrate the difference between quantum and classical computers and has attracted the interest of experimentalists and theoreticians. In this work we study Boson sampling from general,…

Boson Sampling is the problem of sampling from the same distribution as indistinguishable single photons at the output of a linear optical interferometer. It is an example of a non-universal quantum computation which is believed to be…

Boson Sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialised quantum computer. Current experimental schemes, however, are still…

Boson sampling is a problem intractable for classical computers, but can be naturally solved on a specialized photonic quantum simulator which requires less resources than building a universal quantum computer. The biggest challenge to…

The coupling of spins to long-wavelength bosonic modes is a prominent means to engineer long-range spin-spin interactions, and has been realized in a variety of platforms, such as atoms in optical cavities and trapped ions. To date, much of…

The boson sampling problem has triggered a lot of interest in the scientific community because of its potential of demonstrating the computational power of quantum interference without the need of non-linear processes. However, the…

Boson sampling has been theoretically proposed and experimentally demonstrated to show quantum computational advantages. However, it still lacks the deep understanding of the practical applications of boson sampling. Here we propose that…

Sampling the distribution of bosons that have undergone a random unitary evolution is strongly believed to be a computationally hard problem. Key to outperforming classical simulations of this task is to increase both the number of input…

Experimental demonstration of the quantum advantage over classical simulations with Boson Sampling is currently under intensive investigation. There seems to be a scalability issue to the necessary number of bosons on the linear optical…

Quantum computers are expected to be more efficient in performing certain computations than any classical machine. Unfortunately, the technological challenges associated with building a full-scale quantum computer have not yet allowed the…