Saved in:
| Main Authors: | Bassirian, Roozbeh, Bouland, Adam, Fefferman, Bill, Gunn, Sam, Tal, Avishay |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2111.14846 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Exponential improvements to the average-case hardness of BosonSampling
by: Bouland, Adam, et al.
Published: (2024)
by: Bouland, Adam, et al.
Published: (2024)
Quantum Merlin-Arthur with an internally separable proof
by: Bassirian, Roozbeh, et al.
Published: (2024)
by: Bassirian, Roozbeh, et al.
Published: (2024)
Complexity-theoretic foundations of BosonSampling with a linear number of modes
by: Bouland, Adam, et al.
Published: (2023)
by: Bouland, Adam, et al.
Published: (2023)
Superposition detection and QMA with non-collapsing measurements
by: Bassirian, Roozbeh, et al.
Published: (2024)
by: Bassirian, Roozbeh, et al.
Published: (2024)
Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)
by: Fefferman, Bill, et al.
Published: (2024)
Random Circuit Sampling: Fourier Expansion and Statistics
by: Kalai, Gil, et al.
Published: (2024)
by: Kalai, Gil, et al.
Published: (2024)
Quantum One-Time Protection of any Randomized Algorithm
by: Gunn, Sam, et al.
Published: (2024)
by: Gunn, Sam, et al.
Published: (2024)
Phase transition in Random Circuit Sampling
by: Morvan, A., et al.
Published: (2023)
by: Morvan, A., et al.
Published: (2023)
Efficient Unitary T-designs from Random Sums
by: Chen, Chi-Fang, et al.
Published: (2024)
by: Chen, Chi-Fang, et al.
Published: (2024)
Sample-efficient benchmarking of shallow all-to-all random quantum circuits
by: Bentsen, Gregory, et al.
Published: (2026)
by: Bentsen, Gregory, et al.
Published: (2026)
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
by: Fefferman, Bill, et al.
Published: (2025)
by: Fefferman, Bill, et al.
Published: (2025)
TE-PAI: Exact Time Evolution by Sampling Random Circuits
by: Kiumi, Chusei, et al.
Published: (2024)
by: Kiumi, Chusei, et al.
Published: (2024)
Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)
by: Kretschmer, William, et al.
Published: (2024)
Applications of Certified Randomness
by: Amer, Omar, et al.
Published: (2025)
by: Amer, Omar, et al.
Published: (2025)
Quantum-inspired classical algorithm for graph problems by Gaussian boson sampling
by: Oh, Changhun, et al.
Published: (2023)
by: Oh, Changhun, et al.
Published: (2023)
Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\times$ Faster Quantum Random Circuit Sampling
by: Zhao, Xian-He, et al.
Published: (2024)
by: Zhao, Xian-He, et al.
Published: (2024)
A Relativizing MIP for BQP
by: Aaronson, Scott, et al.
Published: (2026)
by: Aaronson, Scott, et al.
Published: (2026)
Random Quantum Circuits
by: Fisher, Matthew P. A., et al.
Published: (2022)
by: Fisher, Matthew P. A., et al.
Published: (2022)
On the hardness of learning ground state entanglement of geometrically local Hamiltonians
by: Bouland, Adam, et al.
Published: (2024)
by: Bouland, Adam, et al.
Published: (2024)
On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)
by: Marwaha, Kunal, et al.
Published: (2025)
Random Projection using Random Quantum Circuits
by: Kumaran, Keerthi, et al.
Published: (2023)
by: Kumaran, Keerthi, et al.
Published: (2023)
Quantum Cryptography in Algorithmica
by: Kretschmer, William, et al.
Published: (2022)
by: Kretschmer, William, et al.
Published: (2022)
Improved Lower Bounds for QAC0
by: Joshi, Malvika Raj, et al.
Published: (2025)
by: Joshi, Malvika Raj, et al.
Published: (2025)
Unconditional Quantum Advantage for Sampling with Shallow Circuits
by: Watts, Adam Bene, et al.
Published: (2023)
by: Watts, Adam Bene, et al.
Published: (2023)
Classical algorithm for simulating experimental Gaussian boson sampling
by: Oh, Changhun, et al.
Published: (2023)
by: Oh, Changhun, et al.
Published: (2023)
Quantum-inspired classical algorithm for molecular vibronic spectra
by: Oh, Changhun, et al.
Published: (2022)
by: Oh, Changhun, et al.
Published: (2022)
The state hidden subgroup problem and an efficient algorithm for locating unentanglement
by: Bouland, Adam, et al.
Published: (2024)
by: Bouland, Adam, et al.
Published: (2024)
Certified Random Number Generation using Quantum Computers
by: Nath, Pingal Pratyush, et al.
Published: (2025)
by: Nath, Pingal Pratyush, et al.
Published: (2025)
Resource-Optimal Importance Sampling for Randomized Quantum Algorithms
by: Cugini, Davide, et al.
Published: (2026)
by: Cugini, Davide, et al.
Published: (2026)
How to Use Quantum Indistinguishability Obfuscation
by: Coladangelo, Andrea, et al.
Published: (2023)
by: Coladangelo, Andrea, et al.
Published: (2023)
Bounding the Sample Fluctuation for Pure States Certification with Local Random Measurement
by: Chen, Langxuan, et al.
Published: (2024)
by: Chen, Langxuan, et al.
Published: (2024)
On the complexity of sampling from shallow Brownian circuits
by: Bentsen, Gregory, et al.
Published: (2024)
by: Bentsen, Gregory, et al.
Published: (2024)
Quantum Speedup for Sampling Random Spanning Trees
by: Apers, Simon, et al.
Published: (2025)
by: Apers, Simon, et al.
Published: (2025)
Peaked quantum advantage using error correction
by: Deshpande, Abhinav, et al.
Published: (2025)
by: Deshpande, Abhinav, et al.
Published: (2025)
Self-Testing Positive Operator-Valued Measurements and Certifying Randomness
by: Wang, Wenjie, et al.
Published: (2024)
by: Wang, Wenjie, et al.
Published: (2024)
Certifying Randomness or its Lack Thereof for General Network Scenarios
by: Alañón, Maria Ciudad, et al.
Published: (2025)
by: Alañón, Maria Ciudad, et al.
Published: (2025)
On the Equivalence between Classical Position Verification and Certified Randomness
by: Kaleoglu, Fatih, et al.
Published: (2024)
by: Kaleoglu, Fatih, et al.
Published: (2024)
Randomized Benchmarking with Synthetic Quantum Circuits
by: Fan, Yale, et al.
Published: (2024)
by: Fan, Yale, et al.
Published: (2024)
Randomized Benchmarking Protocol for Dynamic Circuits
by: Shirizly, Liran, et al.
Published: (2024)
by: Shirizly, Liran, et al.
Published: (2024)
Measure and Forget Dynamics in Random Circuits
by: He, Yucheng, et al.
Published: (2025)
by: He, Yucheng, et al.
Published: (2025)
Similar Items
-
Exponential improvements to the average-case hardness of BosonSampling
by: Bouland, Adam, et al.
Published: (2024) -
Quantum Merlin-Arthur with an internally separable proof
by: Bassirian, Roozbeh, et al.
Published: (2024) -
Complexity-theoretic foundations of BosonSampling with a linear number of modes
by: Bouland, Adam, et al.
Published: (2023) -
Superposition detection and QMA with non-collapsing measurements
by: Bassirian, Roozbeh, et al.
Published: (2024) -
Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits
by: Fefferman, Bill, et al.
Published: (2024)