Related papers: Classical simulation of bosonic linear-optical ran…
Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful…
Learning quantum state properties is both a fundamental and practical problem in quantum information theory. Classical shadows have emerged as an efficient method for estimating properties of unknown quantum states, with rigorous…
We study the classical simulability of noisy random quantum circuits under general noise models. While various classical algorithms for simulating noisy random circuits have been proposed, many of them rely on the anticoncentration…
Boson sampling stands out as a promising approach toward experimental demonstration of quantum computational advantage. However, the presence of physical noise in near-term experiments hinders the realization of the quantum computational…
Many developing quantum technologies make use of quantum networks of different types. Even linear quantum networks are nontrivial, as the output photon distributions can be exponentially complex. Despite this, they can still be…
We develop a classical shadow tomography protocol utilizing the randomized measurement scheme based on hybrid quantum circuits, which consist of layers of two-qubit random unitary gates mixed with single-qubit random projective…
We construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm…
We present and open source a quantum circuit simulator tailored to chemistry applications. More specifically, our simulator can compute the Born-rule probabilities of samples obtained from circuits containing passive fermionic linear…
Classical simulations of quantum circuits play a vital role in the development of quantum computers and for taking the temperature of the field. Here, we classically simulate various physically-motivated circuits using 2D tensor network…
Hamiltonian simulation is a promising application for quantum computers to achieve a quantum advantage. We present classical algorithms based on tensor network methods to optimize quantum circuits for this task. We show that, compared to…
Quantum walks are counterparts of classical random walks. They spread faster, which can be exploited in information processing tasks, and constitute a versatile simulation platform for many quantum systems. Yet, some of their properties can…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
Gaussian Boson Sampling is a model of photonic quantum computing where single-mode squeezed states are sent through linear-optical interferometers and measured using single-photon detectors. In this work, we employ a recent exact sampling…
We describe an efficient, scalable Gaussian boson sampler based on a classical description of squeezed quantum light and a deterministic model of single-photon detectors that click when the incident amplitude falls above a given threshold.…
Quantum computing has brought a paradigm change in computer science, where non-classical technologies have promised to outperform their classical counterpart. Such an advantage was only demonstrated for tasks without practical applications,…
In the era of noisy intermediate-scale quantum computers, variational quantum algorithms are promising approaches for solving optimization tasks by training parameterized quantum circuits with the aid of classical routines informed by…
Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve…
Recently, Motes, Gilchrist, Dowling & Rohde [Phys. Rev. Lett. 113, 120501 (2014)] presented a scheme for photonic boson-sampling using a fiber-loop architecture. Here we show that the same architecture can be modified to implement full,…
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine…
Growing interest in quantum computing for practical applications has led to a surge in the availability of programmable machines for executing quantum algorithms. Present day photonic quantum computers have been limited either to…