Weighted Projective Line ZX Calculus: Quantized Orbifold Geometry for Quantum Compilation

• URL: http://arxiv.org/abs/2512.00682v1
• Date: Sun, 30 Nov 2025 00:56:39 GMT
• Title: Weighted Projective Line ZX Calculus: Quantized Orbifold Geometry for Quantum Compilation
• Authors: Gunhee Cho, Jason Cheng, Evelyn Li,
• Abstract summary: We develop a unified framework for quantum circuit compilation based on quantized orbifold phases and their diagrammatic semantics.<n>We show that these effects admit a natural description on the weighted projective line $mathbbP(a,b)$, whose orbifold points encode discrete phase grids.<n>We introduce the WPL--ZX calculus, an extension of the standard ZX formalism in which each spider carries a weight--phase--winding triple $(a,,k)$.
• Score: 0.764671395172401
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a unified geometric framework for quantum circuit compilation based on quantized orbifold phases and their diagrammatic semantics. Physical qubit platforms impose heterogeneous phase resolutions, anisotropic Bloch-ball contractions, and hardware-dependent $2π$ winding behavior. We show that these effects admit a natural description on the weighted projective line $\mathbb{P}(a,b)$, whose orbifold points encode discrete phase grids and whose monodromy captures winding accumulation under realistic noise channels. Building on this geometry, we introduce the WPL--ZX calculus, an extension of the standard ZX formalism in which each spider carries a weight--phase--winding triple $(a,α,k)$. We prove soundness of LCM-based fusion and normalization rules, derive curvature predictors for phase-grid compatibility, and present the Weighted ZX Circuit Compression (WZCC) algorithm, which performs geometry-aware optimization on heterogeneous phase lattices. To connect circuit-level structure with fault-tolerant architectures, we introduce Monodromy-Aware Surface-Code Decoding (MASD), a winding-regularized modification of minimum-weight matching on syndrome graphs. MASD incorporates orbifold-weighted edge costs, producing monotone decoder-risk metrics and improved robustness across phase-quantized noise models. All results are validated through symbolic and numerical simulations, demonstrating that quantized orbifold geometry provides a coherent and hardware-relevant extension of diagrammatic quantum compilation.

Related papers

• Compile-once block encodings for masked similarity-transformed effective Hamiltonians [9.489652688191917]
  We present COMPOSER, a compile-once modular parametric parametric for similarity-encoded oracle effective reduction of electronic-structure operators.<n>Low-rank factorization compress Hamiltonians and anti-Hermitian generators into rank-one bilinear and projected-quadratic ladders.<n>A fixed orbital pool and qubit register is compiled once; geometry, active-space (mask) updates, and truncations are absorbed by re-dialed single-qubit rotations.
  arXiv  Detail & Related papers  (2026-02-28T18:05:51Z)
• TangramPuzzle: Evaluating Multimodal Large Language Models with Compositional Spatial Reasoning [104.66714520975837]
  We introduce a geometry-grounded benchmark designed to evaluate compositional spatial reasoning through the lens of the classic Tangram game.<n>We propose the Tangram Construction Expression (TCE), a symbolic geometric framework that grounds tangram assemblies in exact, machine-verifiable coordinate specifications.<n>We conduct extensive evaluation experiments on advanced open-source and proprietary models, revealing an interesting insight: MLLMs tend to prioritize matching the target silhouette while neglecting geometric constraints.
  arXiv  Detail & Related papers  (2026-01-23T07:35:05Z)
• Geometric Complexity of Quantum Channels via Unitary Dilations [0.0]
  We introduce and analyze a geometric complexity functional for families of quantum channels based on unitary dilations.<n>We quantify the loss of geometric complexity relative to a prescribed ideal closed evolution.
  arXiv  Detail & Related papers  (2026-01-02T16:28:36Z)
• Curvature-Aware Optimization of Noisy Variational Quantum Circuits via Weighted Projective Line Geometry [1.6683739531034203]
  We develop a differential-geometric framework for variational quantum circuits in which noisy single- and multi-qubit parameter spaces are modeled by weighted projective lines (WPLs)<n>We show that realistic hardware noise induces anisotropic contractions of the Bloch ball that can be represented by a pair of physically interpretable parameters (lambda_perp,_parallel)<n>We demonstrate that WPL-informed quantum natural gradients (WPL-QNG) provide stable optimization dynamics for noisy variational quantum eigensolvers and enable curvature-aware mitigation of barren plateaus.
  arXiv  Detail & Related papers  (2025-11-30T00:43:57Z)
• Untangling Surface Codes: Bridging Braids and Lattice Surgery [51.748182660642776]
  We present a systematic method for translating fault-tolerant quantum circuits between their braiding and lattice surgery representations within the surface code.<n>Our framework provides a foundation for the automated verification, compilation, and benchmarking of large-scale surface code computations.
  arXiv  Detail & Related papers  (2025-11-27T10:12:38Z)
• Engineered Robustness for Nonadiabatic Geometric Quantum Gates [4.88863227820264]
  We present a streamlined framework for nonadiabatic geometric quantum gates (NGQGs)<n>Within this framework, we also design NGQGs using noncyclic paths, offering enhanced design flexibility.<n>Our results identify subtle limitations that compromise performance in two-qubit scenarios.
  arXiv  Detail & Related papers  (2025-11-06T09:54:02Z)
• Pauli Stabilizer Models for Gapped Boundaries of Twisted Quantum Doubles and Applications to Composite Dimensional Codes [0.0]
  We provide new algorithms and provide example constructions of stabilizer models for the gapped boundaries, domain walls, and $0D$ defects of Abelian composite dimensional twisted quantum doubles.<n>Using the physically intuitive concept of condensation, our algorithm explicitly describes how to construct the boundary and domain-wall stabilizers.<n>We discuss the codes' utility in the burgeoning area of quantum error correction with an emphasis on the interplay between deconfined anyons, logical operators, error rates and decoding.
  arXiv  Detail & Related papers  (2025-08-26T17:59:45Z)
• Transolver: A Fast Transformer Solver for PDEs on General Geometries [66.82060415622871]
  We present Transolver, which learns intrinsic physical states hidden behind discretized geometries. By calculating attention to physics-aware tokens encoded from slices, Transovler can effectively capture intricate physical correlations. Transolver achieves consistent state-of-the-art with 22% relative gain across six standard benchmarks and also excels in large-scale industrial simulations.
  arXiv  Detail & Related papers  (2024-02-04T06:37:38Z)
• Geometric phase in a dissipative Jaynes-Cummings model: theoretical explanation for resonance robustness [68.8204255655161]
  We compute the geometric phases acquired in both unitary and dissipative Jaynes-Cummings models. In the dissipative model, the non-unitary effects arise from the outflow of photons through the cavity walls. We show the geometric phase is robust, exhibiting a vanishing correction under a non-unitary evolution.
  arXiv  Detail & Related papers  (2021-10-27T15:27:54Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Solution to the Quantum Symmetric Simple Exclusion Process : the Continuous Case [0.0]
  We present a solution for the invariant probability measure of the one dimensional Q-SSEP in the infinite size limit. We incidentally point out a possible interpretation of the Q-SSEP correlation functions via a surprising conneatorics and the associahedron polytopes.
  arXiv  Detail & Related papers  (2020-06-22T13:20:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.