Symmetric quantum computation
From MaRDI portal
Cites work
- A note on the quantum query complexity of permutation symmetric functions
- Affine systems of equations and counting infinitary logic
- Definability by constant-depth polynomial-size circuits
- Definability of semidefinite programming and Lasserre lower bounds for CSPs
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- Definable inapproximability: new challenges for duplicator
- scientific article; zbMATH DE number 7650815 (Why is no real title available?)
- Limits of symmetric computation (invited talk)
- On symmetric circuits and fixed-point logics
- Quantum advantage with shallow circuits
- Quantum fan-out is powerful
- Solving linear programs without breaking abstractions
- Symmetries, graph properties, and quantum speedups
- The logic of explicitly presentation-invariant circuits
- The need for structure in quantum speedups
- Understanding quantum algorithms via query complexity
This page was built for publication: Symmetric quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445552)