The computational complexity of linear optics
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Physical optics (78A10)
Recommendations
- The computational complexity of linear optics
- A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard
- scientific article; zbMATH DE number 7250159
- The classical complexity of boson sampling
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
Cites work
Cited in
(67)- Unitary matrix decompositions for optimal and modular linear optics architectures
- Establishing simple relationship between eigenvector and matrix elements
- Quantum algorithms for stochastic differential equations: a Schrödingerisation approach
- Families of bosonic suppression laws beyond the permutation symmetry principle
- Quantum de Moivre–Laplace theorem for noninteracting indistinguishable particles in random networks
- Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles
- Performance of the quantum maxent estimation in the presence of physical symmetries
- Cryptographic one-way function based on boson sampling
- Eigenvalues of product of Ginibre ensembles and their inverses and that of truncated Haar unitary matrices and their inverses
- The computational complexity of ball permutations
- On immanant functions related to Weyl groups of \(A_{n}\)
- A little bit of classical magic to achieve (super-)quantum speedup
- Majorization and the time complexity of linear optical networks
- Classical simulation of disspative fermionic linear optics
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- The classical complexity of boson sampling
- Computing the permanent of (some) complex matrices
- Parameterizing density operators with arbitrary symmetries to gain advantage in quantum state estimation
- Boson-sampling with non-interacting fermions
- Unified quantum no-go theorems and transforming of quantum pure states in a restricted set
- Hong-Ou-Mandel interference on a lattice: symmetries and interactions
- Classically simulating quantum circuits with local depolarizing noise
- Towards quantum supremacy with lossy scattershot boson sampling
- Global estimates of errors in quantum computation by the Feynman-Vernon formalism
- \texttt{QOptCraft}: a python package for the design and study of linear optical quantum systems
- scientific article; zbMATH DE number 1738670 (Why is no real title available?)
- Microwave photonics with superconducting quantum circuits
- Efficient computation of permanents, with applications to boson sampling and random matrices
- The computational complexity of linear optics
- Testing permanent oracles -- revisited
- Quantifying non-stabilizerness via information scrambling
- The argument against quantum computers
- A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard
- Optical Implementation of Linear Canonical Transforms
- Integrating products of quadratic forms
- On the permanent of a random symmetric matrix
- On the classical hardness of spoofing linear cross-entropy benchmarking
- How to Verify a Quantum Computation
- The classification of reversible bit operations
- Approximate orthogonality of permutation operators, with application to quantum information
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Photonic quantum information processing using the frequency continuous variable of single photons
- The equivalence of sampling and searching
- Fermionic linear optics revisited
- Many-particle interference in a two-component bosonic Josephson junction: an all-optical simulation
- Algorithmic foundations for the diffraction limit
- On the power of quantum Fourier sampling
- Algorithms for \(\mathrm{SU}(n)\) boson realizations and \(\mathcal{D}\)-functions
- Permanent of bipartite graphs in terms of determinants
- scientific article; zbMATH DE number 7453153 (Why is no real title available?)
- Near invariance of the hypercube
- Permanental ideals of symmetric matrices
- The complexity of approximating complex-valued Ising and Tutte partition functions
- A polynomial-time classical algorithm for noisy random circuit sampling
- Statistical benchmark for bosonsampling
- Approximating permanents and hafnians
- Fair selection of clearing schemes for kidney exchange markets
- Simulating macroscopic quantum correlations in linear networks
- On the classical complexity of sampling from quantum interference of indistinguishable bosons
- A qubit, a coin, and an advice string walk into a relational problem
- Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target
- scientific article; zbMATH DE number 7559454 (Why is no real title available?)
- Exact and efficient simulation of concordant computation
- scientific article; zbMATH DE number 7250159 (Why is no real title available?)
- Roughness as classicality indicator of a quantum state
- Spectral norm of a symmetric tensor and its computation
- New inequalities for permanents and hafnians and some generalizations
This page was built for publication: The computational complexity of linear optics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191572)
