Key papers

• Online Locality Meets Distributed Quantum Computing (2024)
  Amirreza Akbari et al.
  9.32
• A Lattice Problem In Quantum NP (2003)
  Dorit Aharonov, Oded Regev
  8.82
• Trading Locality For Time: Certifiable Randomness From Low-depth Circuits (2018)
  Matthew Coudron, Jalex Stark, Thomas Vidick
  8.60
• New Upper And Lower Bounds For Randomized And Quantum Local Search (2006)
  Shengyu Zhang
  8.35
• Monotonicity Of The Quantum Linear Programming Bound (1998)
  Eric M. Rains
  7.16
• On The Efficiency Of Classical And Quantum Secure Function Evaluation (2012)
  Severin Winkler, Jürg Wullschleger
  6.34
• Efficient Algorithms for Weakly-Interacting Quantum Spin Systems (2026)
  Ryan L. Mann et al.
  3.12
• Two Slightly-entangled Np-complete Problems (2005)
  Roman Orus
  2.26
• Qubit Complexity Of Continuous Problems (2005)
  A. Papageorgiou, J. F. Traub
  2.26
• Graphical and algebraic methods for Boolean factoring (2026)
  Simon Martiel et al.
  1.89
• Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders (2026)
  Vishnu Iyer et al.
  1.67
• Strassen's support functionals coincide with the quantum functionals (2026)
  Keiya Sakabe et al.
  1.61
• Quantum circuits for permutation matrices (2025)
  Jason Hanson
  1.56
• Taming Barren Plateaus in Arbitrary Parameterized Quantum Circuits without Sacrificing Expressibility (2025)
  Zhenyu Chen et al.
  1.50
• Unitary synthesis with fewer T gates (2025)
  Xinyu Tan
  1.39
• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits (2025)
  Jefferson D. S. Silva and Adenilton J. da Silva
  1.28
• Efficient Algorithms for Quantum Hashing (2025)
  Ilnar Zinnatullin and Kamil Khadiev
  1.28
• Quantum Circuit Optimization by Graph Coloring (2025)
  Hochang Lee et al.
  0.94
• On The Computational Power Of QAC0 With Barely Superlinear Ancillae (2024)
  Anurag Anshu, Yangjing Dong, Fengning Ou, et al.
  0.00
• The PRODSAT Phase Of Random Quantum Satisfiability (2024)
  Joon Lee, Nicolas MacRis, Jean Bernoulli Ravelomanana, et al.
  0.00
• Several Natural Bqp-complete Problems (2006)
  Pawel Wocjan, Shengyu Zhang
  0.00
• Depth-2 QAC circuits cannot simulate quantum parity (2020)
  Daniel Pad\'e (University of South Carolina) et al.
  —
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz (2020)
  Roeland Wiersema et al.
  —
• An efficient quantum algorithm for lattice problems achieving subexponential approximation factor (2022)
  Lior Eldar and Sean Hallgren
  —
• New Quantum Algorithms for Computing Quantum Entropies and Distances (2022)
  Qisheng Wang and Ji Guan and Junyi Liu and Zhicheng Zhang and Mingsheng Ying
  —
• Reducing the Depth of Quantum FLT-Based Inversion Circuit (2022)
  Harashta Tatimma Larasati et al.
  —
• Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions (2022)
  Sergey Bravyi et al.
  —
• Hardness of braided quantum circuit optimization in the surface code (2023)
  Kunihiro Wasa et al.
  —
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications (2023)
  Kaiwen Gui et al.
  —
• Space-bounded quantum state testing via space-efficient quantum singular value transformation (2023)
  Fran\c{c}ois Le Gall et al.
  —
• Quantum Multiplier Based on Exponent Adder (2023)
  Junpeng Zhan
  —
• Optimising quantum circuits is generally hard (2023)
  John van de Wetering et al.
  —
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes (2024)
  Alice Barthe et al.
  —
• Quantum advantage from measurement-induced entanglement in random shallow circuits (2024)
  Adam Bene Watts et al.
  —
• Generalization Error Bound for Quantum Machine Learning in NISQ Era -- A Survey (2024)
  Bikram Khanal et al.
  —
• Learning Robust Observable to Address Noise in Quantum Machine Learning (2024)
  Bikram Khanal and Pablo Rivas
  —
• Low-degree approximation of QAC$^0$ circuits (2024)
  Ashley Montanaro et al.
  —