Shared Phase Arithmetic for Parallel Quantum Rotations
Abstract
A layer of diagonal quantum gates can be specified by an integer-valued function on computational basis states. This description suggests implementing the layer by evaluating that function reversibly and translating its value into a phase using a shared quantum register. We develop this viewpoint for parallel phase kickback (PPK): the weighted sum of several rotation parameters is computed coherently, added once to a phase-gradient state, and then uncomputed. The construction separates the cost of representing a phase function from the cost of applying it. We prove correctness, give explicit error bounds, and analyze logical gate counts for general weights, pairs of rotations, and weights with disjoint binary support. With Clifford-only encoding, a batch uses at most 4(b−1) T gates at b-bit phase resolution, excluding initialization. The first phase reference is prepared with independent rotations synthesized by Gridsynth; additional phase-gradient states then follow from the disjoint-support construction with O(b) T gates each. The resulting bounds identify when shared phase arithmetic reduces amortized rotation cost and when encoding overhead limits that advantage.
Related
- Persistent nonlinear Hall effect driven by parallel field across a topological phase transition and intraband sign-reversing integer quantum Hall effect
- Optimal Quantum-Circuit Synthesis and Implementation of General Unitaries with Parallelized Bitstring-Conditioned Rotations
- Spectral gaps and slow modes of Pauli rotations and random quantum circuits
- Early Fault-Tolerant Magic State Synthesis and Spacetime Efficient Analog Rotations with Color Code on a Superconducting Quantum Processor
- Highly Parallel Real-Space Random Phase Approximation Using Lanczos Quadrature and Interpolation
BibTeX
@misc{wu2026shared,
title = {{Shared Phase Arithmetic for Parallel Quantum Rotations}},
author = {Anbang Wu and Liqiang Lu and Pu Pang and Jianwei Yin and Jingwen Leng and Minyi Guo},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.36574},
eprint = {2609.36574},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.36574},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Shared Phase Arithmetic for Parallel Quantum Rotations
AU - Anbang Wu
AU - Liqiang Lu
AU - Pu Pang
AU - Jianwei Yin
AU - Jingwen Leng
AU - Minyi Guo
PY - 2026
DA - 2026/09/29
PB - arXiv
DO - 10.48550/arxiv.2609.36574
UR - https://arxiv.org/abs/2609.36574
AB - A layer of diagonal quantum gates can be specified by an integer-valued function on computational basis states. This description suggests implementing the layer by evaluating that function reversibly and translating its value into a phase using a shared quantum register. We develop this viewpoint for parallel phase kickback (PPK): the weighted sum of several rotation parameters is computed coherently, added once to a phase-gradient state, and then uncomputed. The construction separates the cost of representing a phase function from the cost of applying it. We prove correctness, give explicit error bounds, and analyze logical gate counts for general weights, pairs of rotations, and weights with disjoint binary support. With Clifford-only encoding, a batch uses at most 4(b−1) T gates at b-bit phase resolution, excluding initialization. The first phase reference is prepared with independent rotations synthesized by Gridsynth; additional phase-gradient states then follow from the disjoint-support construction with O(b) T gates each. The resulting bounds identify when shared phase arithmetic reduces amortized rotation cost and when encoding overhead limits that advantage.
ER -