arXiv subjects

Henri de Boutray

Publications and source records attributed to Henri de Boutray.

7 recordsLinked to original sources

arXiv2025

H-DES: a Quantum-Classical Hybrid Differential Equation Solver

In this article, we introduce an original hybrid quantum-classical algorithm based on a variational quantum algorithm for solving systems of differential equations. The algorithm relies on a spectral decomposition of the trial functions that are encoded directly in the quantum states generated by different parametrized circuits, and transforms the task of solving the differential equations into an optimization problem. We first describe the principle of the algorithm from a theoretical point of view. We provide a detailed pseudo-code of the algorithm, on which we elaborate preliminary elements for a complexity analysis to highlight some of its scaling properties. We apply our algorithm to a set of examples, running on emulators and real hardware showcasing its applicability across diverse sets of differential equations. We discuss the advantages of our method and potential avenues for further exploration and refinement.

quant-ph↗

arXiv2025

Hexagons govern three-qubit contextuality

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 neither of the two yields observable-based contextual configurations of their own, {\it classically}-embedded copies are found to fully encode contextuality properties of the most prominent three-qubit contextual configurations in the following sense: for each set of unsatisfiable contexts of such a contextual configuration there exists some classically-embedded hexagon sharing with the configuration exactly this set of contexts and nothing else. We demonstrate this fascinating property first on the configuration comprising all 315 contexts of the space and then on doilies, both types of quadrics as well as on complements of skew-embedded hexagons. In connection with the last-mentioned case and elliptic quadrics we also conducted some experimental tests on a Noisy Intermediate Scale Quantum (NISQ) computer to substantiate our theoretical findings.

quant-ph↗

arXiv2024

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

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 located in binary symplectic polar spaces of small rank. With this code we were not only able to recover, in a more efficient way, all the results of a recent paper by de Boutray et al [(2022). Journal of Physics A: Mathematical and Theoretical 55 475301], but also arrived at a bunch of new noteworthy results. The paper first describes the algorithms and the C code. Then it illustrates its power on a number of subspaces of symplectic polar spaces whose rank ranges from 2 to 7. The most interesting new results include: (i) non-contextuality of configurations whose contexts are subspaces of dimension 2 and higher, (ii) non-existence of negative subspaces of dimension 3 and higher, (iii) considerably improved bounds for the contextuality degree of both elliptic and hyperbolic quadrics for rank 4, as well as for a particular subgeometry of the three-qubit space whose contexts are the lines of this space, (iv) proof for the non-contextuality of perpsets and, last but not least, (v) contextual nature of a distinguished subgeometry of a multi-qubit doily, called a two-spread, and computation of its contextuality degree. Finally, in the three-qubit polar space we correct and improve the contextuality degree of the full configuration and also describe finite geometric configurations formed by unsatisfiable/invalid constraints for both types of quadrics as well as for the geometry whose contexts are all 315 lines of the space.

quant-ph↗

arXiv2023

Contextuality degree of quadrics in multi-qubit symplectic polar spaces

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 proofs, aka. observable-based proofs of the Kochen-Specker Theorem, we formulate the contextuality property as the absence of solutions to a linear system and define for a contextual configuration its degree of contextuality. Then we explain why subgeometries of binary symplectic polar spaces are candidates for contextuality proofs. We report the results of a software that generates these subgeometries, decides their contextuality and computes their contextuality degree for some small symplectic polar spaces. We show that quadrics in the symplectic polar space $W_n$ are contextual for $n=3,4,5$. The proofs we consider involve more contexts and observables than the smallest known proofs. This intermediate size property of those proofs is interesting for experimental tests, but could also be interesting in quantum game theory.

quant-ph↗

arXiv2022

Three-Qubit-Embedded Split Cayley Hexagon is Contextuality Sensitive

It is known that there are two non-equivalent embeddings of the split Cayley hexagon of order two into $\mathcal{W}(5,2)$, the binary symplectic polar space of rank three, called classical and skew. Labelling the 63 points of $\mathcal{W}(5,2)$ by the 63 canonical observables of the three-qubit Pauli group subject to the symplectic polarity induced by the (commutation relations between the elements of the) group, the two types of embedding are found to be quantum contextuality sensitive. In particular, we show that the complement of a classically-embedded hexagon is not contextual, whereas that of a skewly-embedded one is.

quant-ph↗

arXiv2021

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

We study certain physically-relevant subgeometries of binary symplectic polar spaces $W(2N-1,2)$ of small rank $N$, when the points of these spaces canonically encode $N$-qubit observables. Key characteristics of a subspace of such a space $W(2N-1,2)$ are: the number of its negative lines, the distribution of types of observables, the character of the geometric hyperplane the subspace shares with the distinguished (non-singular) quadric of $W(2N-1,2)$ and the structure of its Veldkamp space. In particular, we classify and count polar subspaces of $W(2N-1,2)$ whose rank is $N-1$. $W(3,2)$ features three negative lines of the same type and its $W(1,2)$'s are of five different types. $W(5,2)$ is endowed with 90 negative lines of two types and its $W(3,2)$'s split into 13 types. 279 out of 480 $W(3,2)$'s with three negative lines are composite, i.\,e. they all originate from the two-qubit $W(3,2)$. Given a three-qubit $W(3,2)$ and any of its geometric hyperplanes, there are three other $W(3,2)$'s possessing the same hyperplane. The same holds if a geometric hyperplane is replaced by a `planar' tricentric triad. A hyperbolic quadric of $W(5,2)$ is found to host particular sets of seven $W(3,2)$'s, each of them being uniquely tied to a Conwell heptad with respect to the quadric. There is also a particular type of $W(3,2)$'s, a representative of which features a point each line through which is negative. Finally, $W(7,2)$ is found to possess 1908 negative lines of five types and its $W(5,2)$'s fall into as many as 29 types. 1524 out of 1560 $W(5,2)$'s with 90 negative lines originate from the three-qubit $W(5,2)$. Remarkably, the difference in the number of negative lines for any two distinct types of four-qubit $W(5,2)$'s is a multiple of four.

quant-ph↗

arXiv2020

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

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 first consider Grover's quantum search algorithm, noticing that states during the algorithm are maximally entangled in the direction of a single constant state, which allows us to search for a single optimal Mermin operator and use it to evaluate entanglement through the whole execution of Grover's algorithm. Then the Quantum Fourier Transform is also studied with Mermin polynomials. A different optimal Mermin operator is searched at each execution step, since in this case there is no single direction of evolution. The results for the Quantum Fourier Transform are compared to results from a previous study of entanglement with Cayley hyperdeterminant. All our computations can be replayed thanks to a structured and documented open-source code that we provide.

quant-ph↗