Complexity-theoretic foundations of quantum supremacy experiments
From MaRDI portal
Recommendations
Cited in
(37)- The classical complexity of boson sampling
- Quantum circuit design for objective function maximization in gate-model quantum computers
- State stabilization for gate-model quantum computers
- Quantum science and quantum technology
- Post-processing optimization for continuous-variable quantum key distribution
- The equivalence of sampling and searching
- Verification of quantum computation: an overview of existing approaches
- Trading locality for time: certifiable randomness from low-depth circuits
- Entanglement accessibility measures for the quantum Internet
- Entanglement concentration service for the quantum Internet
- Decoherence dynamics estimation for superconducting gate-model quantum computers
- BQP and the polynomial hierarchy
- The equivalence of sampling and searching
- The road to quantum computational supremacy
- Forrelation: a problem that optimally separates quantum from classical computing
- Parameterization of tensor network contraction
- Average-case quantum advantage with shallow circuits
- The argument against quantum computers
- On the classical hardness of spoofing linear cross-entropy benchmarking
- On the power of quantum Fourier sampling
- Fast and scalable quantum computing simulation on multi-core and many-core platforms
- Efficient algorithm for full-state quantum circuit simulation with DD compression while maintaining accuracy
- Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Random quantum circuits transform local noise into global white noise
- Certified randomness from quantum supremacy
- A polynomial-time classical algorithm for noisy random circuit sampling
- Quantum computational complexity with photons and linear optics
- On the need for large quantum depth
- Quantum advantage from one-way functions
- Performance analysis and modeling for quantum computing simulation on distributed GPU platforms
- Quantum cryptography and meta-complexity
- Efficient mutual magic and magic capacity with matrix product states
- A qubit, a coin, and an advice string walk into a relational problem
- Fidelity decay and error accumulation in random quantum circuits
- The quantum supremacy Tsirelson inequality
- Channel estimation and carrier detection for multiuser multicarrier continuous-variable quantum key distribution
- Classical algorithms for constant approximation of the ground state energy of local Hamiltonians
This page was built for publication: Complexity-theoretic foundations of quantum supremacy experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111152)
