73 citations · 100 across the 12 of their papers we have counts for
13 papers
Quantum amplitude estimation beyond power-of-two schedules
Farrokh Labib
Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adapti…
Stabilizer rank bounds for magic-state orbits
Farrokh Labib, Vincent Russo
Distinct Clifford orbits of magic states can exhibit different stabilizer ranks at small tensor powers. We establish this for qutrits, where the single-qutrit Clifford group has fo…
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Bradley A. Chase, Farrokh Labib
Exact classical simulation of fault-tolerant quantum circuits remains limited by a tradeoff between exponential state vector scaling, exponential -count scaling in stabilizer-ra…
Compressed Sensing for Efficient Fidelity Estimation of GHZ States
Farrokh Labib, David Nicholaeff, Vincent Russo +1
Accurately characterizing multipartite entangled states is a critical challenge in quantum information processing. In this work, we focus on applying compressed sensing techniques…
Towards violations of Local Friendliness with quantum computers
William J. Zeng, Farrokh Labib, Vincent Russo
Local Friendliness (LF) inequalities follow from seemingly reasonable assumptions about reality: (i) ``absoluteness of observed events'' (e.g., every observed event happens for all…
Quantum amplitude estimation from classical signal processing
Farrokh Labib, B. David Clader, Nikitas Stamatopoulos +1
We demonstrate that the problem of amplitude estimation, a core subroutine used in many quantum algorithms, can be mapped directly to a problem in signal processing called directio…
Quantum Motif Clustering
Chris Cade, Farrokh Labib, Ido Niesen
We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the ot…
Stabilizer rank and higher-order Fourier analysis
Farrokh Labib
We establish a link between stabilizer states, stabilizer rank, and higher-order Fourier analysis -- a still-developing area of mathematics that grew out of Gowers's celebrated Fou…
Low depth algorithms for quantum amplitude estimation
Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib +2
We design and analyze two new low depth algorithms for amplitude estimation (AE) achieving an optimal tradeoff between the quantum speedup and circuit depth. For , our…
High-entropy dual functions over finite fields and locally decodable codes
Jop Briët, Farrokh Labib
We show that for infinitely many primes , there exist dual functions of order over that cannot be approximated in -distance by polynomial phase fu…
Quasirandom quantum channels
Tom Bannink, Jop Briët, Farrokh Labib +1
Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties corre…
Bounding quantum-classical separations for classes of nonlocal games
Tom Bannink, Jop Briët, Harry Buhrman +2
We bound separations between the entangled and classical values for several classes of nonlocal -player games. Our motivating question is whether there is a family of -player…
The tautological ring of via Pandharipande-Pixton-Zvonkine -spin relations
Reinier Kramer, Farrokh Labib, Danilo Lewanski +1
We use relations in the tautological ring of the moduli spaces derived by Pandharipande, Pixton, and Zvonkine from the Givental formula for the -s…