A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms

Aparna Gupte; Seyoon Ragavan; Mark Zhandry

Home/Archive/arXiv

arXiv · 2609.40062

A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms

Aparna Gupte·Seyoon Ragavan·Mark Zhandry

View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish a no-go theorem for a broad class of quantum algorithms for the dihedral coset problem (DCP). We consider the Fourier-sampling and subset-sum-measurement template proposed by Regev (SIAM Journal on Computing, 2004), which is one of the main approaches to solving DCP. Suppose that, after measuring the lower $n-1$ bits of the subset sum, the algorithm discards any $ω(\log n)$ bits from each of the Fourier labels. Then we prove that the algorithm cannot succeed in solving DCP. This shows that any algorithm following this template must make extensive use of the Fourier labels, and thus serves as a useful guide for developing algorithms for DCP. As a main application, we show that the recent algorithm by Simon (IACR ePrint:2026/1591, August 11 2026) does not solve DCP. We show that after the subset-sum measurement, this algorithm can be implemented (up to exponentially-small error) using only the most-significant third of the Fourier labels, and is therefore subject to our general no-go theorem. To help with verifiability, we release Lean 4 code for our results.

Explore related subjects

quant-ph cs.CR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Aparna Gupte, Seyoon Ragavan, Mark Zhandry. 2026-09-30. A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms. https://arxiv.org/abs/2609.40062

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Modeling Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits

The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct - uniform random displacement errors - and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state read-out and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.

quant-ph↗

arXiv2026

Dynamical quantum phase transition with singular multipartite entanglement

We investigate the nonequilibrium quench dynamics of the one-dimensional transverse-field Ising model in both integrable and nonintegrable regimes. In particular, we report on a novel type of dynamical quantum phase transition (DQPT) that is characterized by a singular multipartite entanglement signature occurring at critical times in the post-quench dynamics. We show that this behavior is fundamentally distinct from previously studied DQPTs characterized by a nonanalytic rate function. We quantify the multipartite entanglement of the state by the quantum Fisher information and demonstrate that the DQPT belongs to a different universality class than the ground-state phase transition. Furthermore, we perform a spectral analysis of the DQPT and demonstrate that it is a genuine nonequilibrium transition arising from the constructive interference of excited states of the system during the many-body dynamics. Finally, we discuss potential experimental realizations in Rydberg platforms as well as applications in the context of quantum metrology.

quant-ph↗

arXiv2026

The Quantum Formalism Revisited

For the simple system of a point-like particle confined to a straight line, I compile, initially in a concise table, the structural elements of quantum mechanics and contrast them with those of classical (statistical) mechanics. Despite many similarities, there are the well-known fundamental differences, resulting from the algebraic non-commutativity in the quantal structure. The latter was discovered by Werner Heisenberg (1901-1976) in June 1925 on the small island of Helgoland in the North Sea, as a consequence of understanding atomic spectral data within a matrix scheme consistent with energy conservation. I discuss the differences and exemplify their quantifications by the variance and entropic indeterminacy inequalities, by (pseudo-)classical bounds on quantum canonical partition functions, and by the correlation inequalities of John Bell (1928-1990) and others.

quant-ph↗