FL
Farrokh Labib
quant-phcs.DSmath.COmath.NT
On Valency
published · living versionsW_yfjxx4t6·v1 · currentpublished
Perspective on AI and quantum open-source software
with Changhao Li, Bradley A. Chase, Veena Vijayakumar, Mathys Rennela +9
1 version
Preprints & journals
11 papers in the corpus · 2018–2026Quantum amplitude estimation beyond power-of-two schedules2609.02715v1 · Farrokh Labib2026 · 0 citationsarXiv
Stabilizer rank bounds for magic-state orbits2605.28586v1 · Farrokh Labib, Vincent Russo2026 · 0 citationsarXiv
Compressed Sensing for Efficient Fidelity Estimation of GHZ States2604.27824v1 · Farrokh Labib, David Nicholaeff, Vincent Russo et al.2026 · 0 citationsarXiv
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits2604.27058v2 · Bradley A. Chase, Farrokh Labib2026 · 0 citationsarXiv
Towards violations of Local Friendliness with quantum computers2409.15302v3 · William J. Zeng, Farrokh Labib, Vincent Russo2024 · 0 citationsQuantum 9, 1851 (2025)
Quantum amplitude estimation from classical signal processing2405.14697v2 · Farrokh Labib, B. David Clader, Nikitas Stamatopoulos et al.2024 · 0 citationsarXiv
Quantum Motif Clustering2111.13222v2 · Chris Cade, Farrokh Labib, Ido Niesen2021 · 2 citationsQuantum 7, 1046 (2023)
Stabilizer rank and higher-order Fourier analysis2107.10551v2 · Farrokh Labib2021 · 16 citationsQuantum 6, 645 (2022)
Low depth algorithms for quantum amplitude estimation2012.03348v2 · Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib et al.2020 · 72 citationsQuantum 6, 745 (2022)
High-entropy dual functions over finite fields and locally decodable codes2010.14956v3 · Jop Briet, Farrokh Labib2020 · 0 citationsForum of Mathematics, Sigma , Volume 9 , 2021 , e19
Bounding quantum-classical separations for classes of nonlocal games1811.11068v1 · Tom Bannink, Jop Briet, Harry Buhrman et al.2018 · 3 citationsarXiv
Career total: 16 works. 11 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.