Simulating and assessing boson sampling experiments with phase-space representations
arXiv:1802.06576 · doi:10.1103/PhysRevA.97.042304
Abstract
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, with experimental demonstrations and potential for obtaining a quantum computer to solve problems believed classically impossible. This introduces a challenge: how does one design or understand such photonic networks? One must be able to calculate observables using general methods capable of treating arbitrary inputs, dissipation and noise. We develop novel complex phase-space software for simulating these photonic networks, and apply this to boson sampling experiments. Our techniques give sampling errors orders of magnitude lower than experimental correlation measurements for the same number of samples. We show that these techniques remove systematic errors in previous algorithms for estimating correlations, with large improvements in errors in some cases. In addition, we obtain a scalable channel-combination strategy for assessment of boson sampling devices.
References in corpus (27)
- Universal Linear Optics
- Boson Sampling on a Photonic Chip
- Experimental Boson Sampling
- Experimental boson sampling in arbitrary integrated photonic circuits
- Photonic Boson Sampling in a Tunable Circuit
- Efficient experimental validation of photonic boson sampling against the uniform distribution
- Experimental Scattershot Boson Sampling
- On the experimental verification of quantum complexity in linear optics
- BosonSampling with single-photon Fock states from a bright solid-state source
- Exact steady state of a Kerr resonator with one- and two-photon driving and dissipation: Controllable Wigner-function multimodality and dissipative phase transitions
- Scalable boson sampling with a single-photon device
- Quantum teleportation over 100 km of fiber using highly-efficient superconducting nanowire single photon detectors
- Stringent and efficient assessment of Boson-Sampling devices
- Linear Optical Quantum Metrology with Single Photons: Exploiting Spontaneously Generated Entanglement to Beat the Shot-Noise Limit
- Zero-Transmission Law for Multiport Beam Splitters
- Reliable quantum certification for photonic quantum technologies
- A Linear-Optical Proof that the Permanent is #P-Hard
- A Statistical Benchmark for BosonSampling
- Exact results for Schrödinger cats in driven-dissipative systems and their feedback control
- Counting Statistics of Many-Particle Quantum Walks
- Multiphoton interference in quantum Fourier transform circuits and applications to quantum metrology
- Universality of Generalized Bunching and Efficient Assessment of Boson Sampling
- Two coupled nonlinear cavities in a driven-dissipative environment
- Linear optical quantum metrology with single photons --- Experimental errors, resource counting, and quantum Cramér-Rao bounds
- The scaling of boson sampling experiments
- Coherent states in projected Hilbert spaces
- Coherent functional expansions in quantum field theory
Cited by in corpus (13)
- Simulating complex networks in phase space: Gaussian boson sampling
- Efficient verification of Boson Sampling
- Nonlocal pair correlations in a higher-order Bose gas soliton
- Robustness of quantum Fourier transform interferometry
- Initial states and apodisation for quantum field simulations in phase-space
- Multi-time correlations in the positive-P, Q, and doubled phase-space representations
- Simulating macroscopic quantum correlations in linear networks
- Phase-space simulations of feedback coherent Ising machines
- Exact recursive calculation of circulant permanents: A band of different diagonals inside a uniform matrix
- Approximating outcome probabilities of linear optical circuits
- Matrix phase-space representations for gaussian boson sampling
- Realistic photon-number resolution in Gaussian boson sampling
- Complexity order of multiple resource algorithms