The computational complexity of linear optics
From MaRDI portal
Publication:5419103
DOI10.1145/1993636.1993682zbMath1288.68066OpenAlexW1993292204WikidataQ60587891 ScholiaQ60587891MaRDI QIDQ5419103
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/62805
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (54)
Graph isomorphism and Gaussian boson sampling ⋮ Nonnegativity for hafnians of certain matrices ⋮ Multi-boson correlation sampling ⋮ Arbitrated quantum signature protocol with boson sampling-based random unitary encryption ⋮ Two-boson quantum interference in time ⋮ Anticoncentration and the Exact Gap-Hamming Problem ⋮ Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable ⋮ Constant-round blind classical verification of quantum sampling ⋮ Which role does multiphoton interference play in small phase estimation in quantum Fourier transform interferometers? ⋮ Partial distinguishability as a coherence resource in boson sampling ⋮ An Exact and Practical Classical Strategy for 2D Graph State Sampling ⋮ Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture ⋮ Stochastic approach to evolution of a quantum system interacting with environment in squeezed number state ⋮ Commuting quantum circuits and complexity of Ising partition functions ⋮ Direct dialling of Haar random unitary matrices ⋮ Classical benchmarking of Gaussian boson sampling on the Titan supercomputer ⋮ Optimal approximation to unitary quantum operators with linear optics ⋮ Models in quantum computing: a systematic review ⋮ Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates ⋮ Strong simulation of linear optical processes ⋮ Quantum counterfactuality with identical particles ⋮ Simple tests of quantumness also certify qubits ⋮ Light-Matter Interaction in the ZXW Calculus ⋮ Random quantum circuits transform local noise into global white noise ⋮ Quantum classifiers for domain adaptation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sum rules in multiphoton coincidence rates ⋮ Unnamed Item ⋮ Optimised resource construction for verifiable quantum computation ⋮ Universal quantum computation by scattering in the Fermi–Hubbard model ⋮ SU(p,q) coherent states and a Gaussian de Finetti theorem ⋮ Robustness and device independence of verifiable blind quantum computing ⋮ The Equivalence of Sampling and Searching ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing ⋮ Unnamed Item ⋮ Verification of quantum computation: an overview of existing approaches ⋮ Concentration and Moment Inequalities for Polynomials of Independent Random Variables ⋮ Generalised phase kick-back: the structure of computational algorithms from physical principles ⋮ Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems ⋮ Time independent universal computing with spin chains: quantum plinko machine ⋮ Towards quantum supremacy with lossy scattershot boson sampling ⋮ Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles ⋮ Theory of quantum games and quantum economic behavior ⋮ A quantum hash function with grouped coarse-grained boson sampling ⋮ Learning nonlinear input-output maps with dissipative quantum systems ⋮ A Tight Analysis of Bethe Approximation for Permanent ⋮ Applications of the Lambert-Tsallis \(W_q\) function in quantum photonic Gaussian boson sampling ⋮ Simultaneous sorting many qudits using different input ports ⋮ A quantum interior-point predictor–corrector algorithm for linear programming ⋮ Immanants of blocks from random matrices in some unitary ensembles
This page was built for publication: The computational complexity of linear optics
