Classical benchmarking of Gaussian boson sampling on the Titan supercomputer

DOI10.1007/s11128-020-02713-6OpenAlexW2895734601MaRDI QIDQ2681599

Thomas R. Bromley, Juan Miguel Arrazola, Nicolás Quesada, Brajesh Gupt

Publication date: 3 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.00900

zbMATH Keywords

quantum computationquantum opticsboson samplingquantum benchmarking

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (1)

Simulating macroscopic quantum correlations in linear networks

Uses Software

• DIMACS
• GitHub

Cites Work

• Unnamed Item
• The Classical Complexity of Boson Sampling
• The computational complexity of linear optics
• Towards quantum supremacy with lossy scattershot boson sampling
• The dense \(k\)-subgraph problem

This page was built for publication: Classical benchmarking of Gaussian boson sampling on the Titan supercomputer