Related papers: Classical simulability of constant-depth linear-op…
Recently, constant-depth quantum circuits are proved more powerful than their classical counterparts at solving certain problems, e.g., the two-dimensional (2D) hidden linear function (HLF) problem regarding a symmetric binary matrix. To…
We theoretically investigate quantum interference of two single photons at a lossy asymmetric beam splitter, the most general passive 2$\times$2 optical circuit. The losses in the circuit result in a non-unitary scattering matrix with a…
We give a comprehensive characterization of the computational power of shallow quantum circuits combined with classical computation. Specifically, for classes of search problems, we show that the following statements hold, relative to a…
Noise on quantum devices is much more complex than it is commonly given credit. Far from usual models of decoherence, nearly all quantum devices are plagued both by a continuum of environments and temporal instabilities. These induce noisy…
Photonics is a promising architecture for the realisation of quantum information processing, since the two-photon interaction, or non-linearity, necessary to build logical gates can efficiently be realised by the use of interference with…
We analyze single particle coherence and interference in the presence of particle loss and derive an inequality that relates the preservation of coherence, the creation of superposition with the vacuum, and the degree of particle loss. We…
Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the…
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…
Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
Shallow quantum circuits are believed to be the most promising candidates for achieving early practical quantum advantage - this has motivated the development of a broad range of error mitigation techniques whose performance generally…
For more than a century, the diffraction limit has defined the resolution achievable by passive optical imaging systems. Although some resolution improvement can be gained through classical data processing of the image, it is limited by the…
To simulate noisy boson sampling approximating it by only the lower-order multi-boson interferences (e.g., by a smaller number of interfering bosons and classical particles) is very popular idea. I show that the output data from any such…
Entangled photons have the remarkable ability to be more sensitive to signal and less sensitive to noise than classical light. Joint photons can sample an object collectively, resulting in faster phase accumulation and higher spatial…
Quantum lithography achieves phase super-resolution using fragile, experimentally challenging entangled states of light. We propose a scalable scheme for creating features narrower than classically achievable, with reduced use of quantum…
Linear optics quantum computing (LOQC) is a leading candidate for the implementation of large scale quantum computers. Here quantum information is encoded into the quantum states of light and computation proceeds via a linear optics…
The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by…
Classical shallow networks are universal approximators. Given a sufficient number of neurons, they can reproduce any continuous function to arbitrary precision, with a resource cost that scales linearly in both the input size and the number…
We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed…
Linear optical circuits of growing complexity are playing an increasing role in emerging photonic quantum technologies. Individual photonic devices are typically described by a unitary matrix containing amplitude and phase information, the…