Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2206.03599 · Journal of Computational Science

Multi-qubit doilies: Enumeration for all ranks and classification for ranks four and five

Axel Müller, Метод Санига, Alain Giorgetti, Henri de Boutray, Frédéric Holweck

Published Sep 23, 2022• 13 citations
arXivHTMLPDF
DOI
10.1016/j.jocs.2022.101853

Related papers

Applications with Single Qubits

WORLD SCIENTIFIC eBooks•Nov 1, 2024•0 citations

Computer-assisted enumeration and classification of multi-qubit doilies

Axel Müller, Метод Санига, Alain Giorgetti +2 more

For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.

•Nov 14, 2022•0 citations

The Four-Qubit Hyperbolic Quadric Has Contextuality Degree 315

Zhengyu Li, Amandeep Gupta, Vijay Ganesh

The contextuality degree of a set of Pauli contexts is the least number of contexts that every noncontextual $\pm1$ assignment violates. For the four-qubit hyperbolic quadric $\mathcal{Q}^{+}(7,2)$, with $135$ points and $1575$ lines as contexts, Muller et al. conjectured from heuristic searches that the degree is $315$ and that the violated contexts of every optimal assignment form a dual polar space $DW(5,2)$. We prove both conjectures. The lower bound has a short proof by hand: every doily ($GQ(2,2)$) of the quadric contains ten Peres-Mermin grids covering each of its lines four times, so every assignment violates at least three of its fifteen lines, and averaging over the doilies gives $1575/5=315$. The equality case is local: an assignment is optimal exactly when it violates one ruling of one grid in every doily. Using this as a SAT encoding, we show that there are exactly $240$ optimal violated sets, one orbit of $\mathrm{O}^+(8,2)$, each isomorphic to $DW(5,2)$. The same argument gives the first lower bounds $\lceil L/5\rceil$ for all quadrics with $L$ lines in $N\ge4$ qubits. The degree theorem is kernel-checked in Lean 4, and the completeness of the enumeration is certified by a DRAT proof checked by the verified checker cake_lpr.

quant-pharXiv:2610.26465•Oct 20, 2026•5 citations

Current numbers of qubits and their uses

Tsubasa Ichikawa, Hideaki Hakoshima, Koji Inui +18 more

arXiv:2307.16130•Nature Reviews Physics•May 31, 2024•43 citations

Computer-assisted enumeration of finite geometries related to quantum contextuality

Alain Giorgetti, Axel Müller, Метод Санига +2 more

The talk presents finite geometries, named $N$-qubit doily doilies ($N \geq 2$) related to operator-based proofs of quantum contextuality. We first show closed formulas for the numbers of linear and quadratic doilies for $N > 2$. Then we present an effective algorithm for the generation of all $N$-qubit doilies. Using this algorithm for $N=4$ and $N=5$, we provide a classification of $N$-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.

•Nov 10, 2022•0 citations

Invariants for multiple qubits: the case of 3 qubits

David Meyer, Noland Wallach

Computational matematics series/Computational mathematics series•Feb 14, 2002•2 citations
For N ≥ 2, an N-qubit doily is a doily living in the N-qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following and extending the strategy of [SdBHG21] that focused exclusively on three-qubit doilies, we first bring forth several formulas giving the number of both linear and quadratic doilies for any N > 2. Then we present an effective algorithm for the generation of all N-qubit doilies. Using this algorithm for N = 4 and N = 5, we provide a classification of N-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.
The contextuality degree of a set of Pauli contexts is the least number of contexts that every noncontextual ±1\pm1±1 assignment violates. For the four-qubit hyperbolic quadric Q+(7,2)\mathcal{Q}^{+}(7,2)Q+(7,2), with 135135135 points and 157515751575 lines as contexts, Muller et al. conjectured from heuristic searches that the degree is 315315315 and that the violated contexts of every optimal assignment form a dual polar space DW(5,2)DW(5,2)DW(5,2). We prove both conjectures. The lower bound has a short proof by hand: every doily (GQ(2,2)GQ(2,2)GQ(2,2)) of the quadric contains ten Peres-Mermin grids covering each of its lines four times, so every assignment violates at least three of its fifteen lines, and averaging over the doilies gives 1575/5=3151575/5=3151575/5=315. The equality case is local: an assignment is optimal exactly when it violates one ruling of one grid in every doily. Using this as a SAT encoding, we show that there are exactly 240240240 optimal violated sets, one orbit of O+(8,2)\mathrm{O}^+(8,2)O+(8,2), each isomorphic to DW(5,2)DW(5,2)DW(5,2). The same argument gives the first lower bounds ⌈L/5⌉\lceil L/5\rceil⌈L/5⌉ for all quadrics with LLL lines in N≥4N\ge4N≥4 qubits. The degree theorem is kernel-checked in Lean 4, and the completeness of the enumeration is certified by a DRAT proof checked by the verified checker cake_lpr.
The talk presents finite geometries, named NNN-qubit doily doilies (N≥2N \geq 2N≥2) related to operator-based proofs of quantum contextuality. We first show closed formulas for the numbers of linear and quadratic doilies for N>2N > 2N>2. Then we present an effective algorithm for the generation of all NNN-qubit doilies. Using this algorithm for N=4N=4N=4 and N=5N=5N=5, we provide a classification of NNN-qubit doilies in terms of types of observables they feature and number of negative lines they are endowed with.