activity
20202023
most citedTaxonomy of Polar Subspaces of Multi-Qubit Symplectic Polar Spaces of Small Rank

11 citations · 41 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2023★ 1 cited

Hexagons govern three-qubit contextuality

Metod Saniga, Frédéric Holweck, Colm Kelleher +3

Split Cayley hexagons of order two are distinguished finite geometries living in the three-qubit symplectic polar space in two different forms, called classical and skew. Although…

quant-ph2023★ 4 cited

New and improved bounds on the contextuality degree of multi-qubit configurations

Axel Muller, Metod Saniga, Alain Giorgetti +2

We present algorithms and a C code to reveal quantum contextuality and evaluate the contextuality degree (a way to quantify contextuality) for a variety of point-line geometries lo…

quant-ph2022★ 6 cited

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

Axel Muller, Metod Saniga, Alain Giorgetti +2

For , an -qubit doily is a doily living in the -qubit symplectic polar space. These doilies are related to operator-based proofs of quantum contextuality. Following…

quant-ph2021★ 11 cited

Contextuality degree of quadrics in multi-qubit symplectic polar spaces

Henri de Boutray, Frédéric Holweck, Alain Giorgetti +2

Quantum contextuality takes an important place amongst the concepts of quantum computing that bring an advantage over its classical counterpart. For a large class of contextuality…

quant-ph2021★ 11 cited

Taxonomy of Polar Subspaces of Multi-Qubit Symplectic Polar Spaces of Small Rank

Metod Saniga, Henri de Boutray, Frederic Holweck +1

We study certain physically-relevant subgeometries of binary symplectic polar spaces of small rank , when the points of these spaces canonically encode -qubit obs…

quant-ph2020★ 8 cited

Mermin Polynomials for Entanglement Evaluation in Grover's algorithm and Quantum Fourier Transform

Henri de Boutray, Hamza Jaffali, Frédéric Holweck +2

The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We…