Related papers: Quantum computational advantage using photons
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.…
Recently, a non-Gaussian state, which is called cubic phase state has been experimentally realized. In this work we show that, in case one has access to a proper cubic phase state, it is possible to make photon counting experiments and…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
Quantum computation, aiming at tackling hard problems beyond classical approaches, has been flourishing with each passing day. Unfortunately, a fully scalable and fault-tolerant universal quantum computer remains challenging based on the…
We study the application of squeezed states in a quantum optical scheme for direct sampling of the phase space by photon counting. We prove that the detection setup with a squeezed coherent probe field is equivalent to the probing of the…
Photons naturally solve the BosonSampling problem: sample the outputs of a multi-photon experiment in a linear-optical interferometer. This is strongly believed to be hard to do on a classical computer, and motivates the development of…
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 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…
An important challenge with the current generation of noisy, large-scale quantum computers is the question of validation. Does the hardware generate correct answers? If not, what are the errors? This issue is often combined with questions…
While universal quantum computers ideally solve problems such as factoring integers exponentially more efficiently than classical machines, the formidable challenges in building such devices motivate the demonstration of simpler,…
We show with explicit formulas that one can completely identify an unknown quantum process with only one weakly entangled state; and identify a quantum optical Gaussian process with either one two-mode squeezed state or a few different…
This thesis is an exploration of the power of photonic resources, as viewed from several different but related perspectives. They range from quantum computation, precision parameter estimation to the thermodynamics of relativistic quantum…
Interference of multiple photons via a linear-optical network has profound applications for quantum foundation, quantum metrology and quantum computation. Particularly, a boson sampling experiment with a moderate number of photons becomes…
We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a…
The continuous variable quantum computing platform constitutes a promising candidate for realizing quantum advantage, as exemplified in Gaussian Boson Sampling. While noise in the experiments makes the computation attainable for classical…
Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently simulate using a classical computer, the current Gaussian…
We present a fully digital approach for simulating single-mode squeezed states on a superconducting quantum processor using an enhanced bosonic encoding strategy. By mapping up to 2^{n} photonic Fock states onto n qubits, our framework…
Gaussian Boson Sampling (GBS), which can be realized with a photonic quantum computing model, perform some special kind of sampling tasks. In [4], we introduced algorithms that use GBS samples to approximate Gaussian expectation problems.…
Advances in photonics require photon-number resolved simulations of quantum optical experiments with Gaussian states. We demonstrate a simple and versatile method to simulate the photon statistics of general multimode Gaussian states. The…
Gaussian boson sampling (GBS) is a promising candidate for an experimental demonstration of quantum advantage using photons. However, sufficiently large noise might hinder a GBS implementation from entering the regime where quantum speedup…