Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.
Reichardt and Robert
4 Pith papers cite this work, alongside 147 external citations. Polarity classification is still indexing.
4
Pith papers citing it
147
external citations · OpenAlex
years
2026 4representative citing papers
Quantum query complexity Q_LV(B_N) equals 2(N-1) for the hyperoctahedral group, twice the symmetric group value due to an ε-parity obstruction restricting the sign representation to even tensor powers.
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Gap-Majority Lemmas in Communication Complexity
Computing GapMAJ∘fⁿ requires n·(I−O(1)) bits of information, making GapMAJ the third outer gadget with a strong composition theorem in two-player communication.
-
Quantum Query Complexity of the Hyperoctahedral Group
Quantum query complexity Q_LV(B_N) equals 2(N-1) for the hyperoctahedral group, twice the symmetric group value due to an ε-parity obstruction restricting the sign representation to even tensor powers.
-
Loop Composition in Quantum Algorithms
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.