A5070592520- Quantum Information and Cryptography
- Quantum Computing Algorithms and Architecture
- Quantum Mechanics and Applications
- Quantum and electron transport phenomena
- Neural Networks and Reservoir Computing
- Scientific Computing and Data Management
Xanadu Quantum Technologies (Canada)
2025
University of Bristol
2022
Photonics offers a promising platform for quantum computing1–4, owing to the availability of chip integration mass-manufacturable modules, fibre optics networking and room-temperature operation most components. However, experimental demonstrations are needed complete integrated systems comprising all basic functionalities universal fault-tolerant operation5. Here we construct (sub-performant) scale model computer using 35 photonic chips demonstrate its functionality feasibility. This...
Identifying the boundary beyond which quantum machines provide a computational advantage over their classical counterparts is crucial step in charting usefulness. Gaussian boson sampling (GBS), photons are measured from highly entangled state, leading approach pursuing advantage. State-of-the-art GBS experiments that run minutes would require 600 million years to simulate using best preexisting algorithms. Here, we present faster simulation methods, including speed and accuracy improvements...
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity exponential in number photon pairs detected, not photons, and directly proportional to time required calculate a probability amplitude pure state. main innovation use auxiliary conditioning variables reduce problem computation pure-state amplitudes, which most computationally expensive step calculation loop hafnian. implement benchmark...
In quantum photonics, threshold detectors, distinguishing between vacuum and one or more photons, such as superconducting nanowires avalanche photodiodes, are routinely used to measure Fock Gaussian states of light. Despite being the standard measurement scheme, there is no general closed form expression for probabilities with unless accepting coarse approximations combinatorially scaling summations. Here, we present new matrix functions fill this gap. We develop Bristolian loop Torontonian...
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity exponential in number photon pairs detected, not photons, and directly proportional to time required calculate a probability amplitude pure state. main innovation use auxiliary conditioning variables reduce problem computing pure-state amplitudes, which most computationally-expensive step calculating loop hafnian. implement benchmark...
In quantum photonics, threshold detectors, distinguishing between vacuum and one or more photons, such as superconducting nanowires avalanche photodiodes, are routinely used to measure Fock Gaussian states of light. Despite being the standard measurement scheme, there is no general closed form expression for probabilities with unless accepting coarse approximations combinatorially scaling summations. Here, we present new matrix functions fill this gap. We develop Bristolian loop Torontonian...