Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0808.3849

Three-Qubit Operators, the Split Cayley Hexagon of Order Two and Black Holes

Peter Levay·Metod Saniga·Peter Vrana
View original source ↗Read source document ↗Export metadata ↓

Abstract

The set of 63 real generalized Pauli matrices of three-qubits can be factored into two subsets of 35 symmetric and 28 antisymmetric elements. This splitting is shown to be completely embodied in the properties of the Fano plane; the elements of the former set being in a bijective correspondence with the 7 points, 7 lines and 21 flags, whereas those of the latter set having their counterparts in 28 anti-flags of the plane. This representation naturally extends to the one in terms of the split Cayley hexagon of order two. 63 points of the hexagon split into 9 orbits of 7 points (operators) each under the action of an automorphism of order 7. 63 lines of the hexagon carry three points each and represent the triples of operators such that the product of any two gives, up to a sign, the third one. Since this hexagon admits a full embedding in a projective 5-space over GF(2), the 35 symmetric operators are also found to answer to the points of a Klein quadric in such space. The 28 antisymmetric matrices can be associated with the 28 vertices of the Coxeter graph, one of two distinguished subgraphs of the hexagon. The PSL_{2}(7) subgroup of the automorphism group of the hexagon is discussed in detail and the Coxeter sub-geometry is found to be intricately related to the E_7-symmetric black-hole entropy formula in string theory. It is also conjectured that the full geometry/symmetry of the hexagon should manifest itself in the corresponding black-hole solutions. Finally, an intriguing analogy with the case of Hopf sphere fibrations and a link with coding theory are briefly mentioned.

Explore related subjects

quant-phhep-thmath-phmath.MP

Keep this discovery

BibTeXRIS

Peter Levay, Metod Saniga, Peter Vrana. 2008-09-11. Three-Qubit Operators, the Split Cayley Hexagon of Order Two and Black Holes. https://doi.org/10.1103/physrevd.78.124022

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

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗