Frédéric Holweck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Frédéric Holweck has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Metod Saniga
Astronomical Institute of the Slovak Academy of Sciences, SK-05960 Tatranská Lomnica, Slovakia
15 shared publications - Hamza Jaffali
ColibrITD, 91 Rue du Faubourg Saint Honoré, 75008 Paris, France
9 shared publications - Luke Oeding
Department of Mathematics and Statistics, Auburn University, Auburn, AL, United States of America
6 shared publications - Alain Giorgetti
Université Marie et Louis Pasteur, CNRS, Institut FEMTO-ST , F-25000 Besançon
5 shared publications - Jean-Gabriel Luque
IF Université de Rouen Avenue de l'Université 76801 Cedex Saint-Étienne du Rouvray France
5 shared publications - Michel Planat
Université Marie et Louis Pasteur, Institut FEMTO-ST CNRS, 25000 Besançon, France
5 shared publications
Latest Publications
- Open Access
- 18 August 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (33) , 335105
Local qubit invariants on quantum computer
We present two general methods to implement quantum circuits for the direct measuring of local unitary invariants on quantum computers. We work these out for important three-qubit invariants, and also demonstrate these on the IBM quantum platform for important entanglement measures of three qubits.
- 18 August 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (33) , 335105
Open AccessLocal qubit invariants on quantum computer
We present two general methods to implement quantum circuits for the direct measuring of local unitary invariants on quantum computers. We work these out for important three-qubit invariants, and also demonstrate these on the IBM quantum platform for important entanglement measures of three qubits.
- 13 May 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (5)
Hybrid variational quantum circuit approach for stabilizer-state classifiers
- 13 May 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (5)
Hybrid variational quantum circuit approach for stabilizer-state classifiers
- 23 April 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (21)
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. The algorithm described in this paper is subject to a patent submission (EP24306601). Use of this method requires a license, which can be obtained from ColibriTD.
- 23 April 2026
- Published by IOP Publishing in Physica Scripta
- Vol. 101 (21)
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. The algorithm described in this paper is subject to a patent submission (EP24306601). Use of this method requires a license, which can be obtained from ColibriTD.
- 26 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (21) , 215302
A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals
We introduce and describe a new heuristic method for finding an upper bound on the degree of contextuality and the corresponding unsatisfied (i.e. non-reproducible by any NCHV model) part of a quantum contextual configuration with three-element contexts (i.e. lines) located in a multi-qubit symplectic polar space of order two. While the previously used method based on a SAT solver was limited to three qubits, this new method is much faster and more versatile, enabling us to also handle four- to six-qubit cases. The method is illustrated by the structure of unsatisfied parts of the associated contextual configurations represented by quadrics and full spaces; these entail well-known finite geometries like the split Cayley hexagon of order two, the dual polar space of rank three and order two as well as certain incidence graphs of binary projective spaces of small dimensions.
- 26 May 2025
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 58 (21) , 215302
A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals
We introduce and describe a new heuristic method for finding an upper bound on the degree of contextuality and the corresponding unsatisfied (i.e. non-reproducible by any NCHV model) part of a quantum contextual configuration with three-element contexts (i.e. lines) located in a multi-qubit symplectic polar space of order two. While the previously used method based on a SAT solver was limited to three qubits, this new method is much faster and more versatile, enabling us to also handle four- to six-qubit cases. The method is illustrated by the structure of unsatisfied parts of the associated contextual configurations represented by quadrics and full spaces; these entail well-known finite geometries like the split Cayley hexagon of order two, the dual polar space of rank three and order two as well as certain incidence graphs of binary projective spaces of small dimensions.
- Open Access
Four-Qubit CHSH Games
In this paper, the CHSH quantum game is extended to four players. This is achieved by exploring all possible 4-variable Boolean functions to identify those that yield a game scenario with a quantum advantage using a specific entangled state. Notably, two new four-player quantum games are presented. In one game, the optimal quantum strategy is achieved when players share a $GHZ$-state, breaking the traditional 10\% gain observed in 2 and 3 qubit CHSH games and achieving a 22.5\% gap. In the other game, players gain a greater advantage using a $W$-state as their quantum resource. Quantum games with other four-qubit entangled states are also explored. To demonstrate the results, these game scenarios are implemented on an online quantum computer, and the advantage of the respective quantum resource for each game is experimentally verified.
Open AccessFour-Qubit CHSH Games
In this paper, the CHSH quantum game is extended to four players. This is achieved by exploring all possible 4-variable Boolean functions to identify those that yield a game scenario with a quantum advantage using a specific entangled state. Notably, two new four-player quantum games are presented. In one game, the optimal quantum strategy is achieved when players share a $GHZ$-state, breaking the traditional 10\% gain observed in 2 and 3 qubit CHSH games and achieving a 22.5\% gap. In the other game, players gain a greater advantage using a $W$-state as their quantum resource. Quantum games with other four-qubit entangled states are also explored. To demonstrate the results, these game scenarios are implemented on an online quantum computer, and the advantage of the respective quantum resource for each game is experimentally verified.
- 22 August 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (9) , 095122
Phase sensitivity of entanglement in the Quantum Phase Estimation algorithm
We study entanglement in the steps before Quantum Fourier Transform (pre-QFT) part of the Quantum Phase Estimation and the Quantum Counting algorithms (QPEA—QCA) with the use of three entanglement detection tools. In particular we focus on the sensitivity of entanglement to the input value (the phase ϕ and the ratio of marked elements M N ) in some basic cases. One starts from numerical observations and deduce some general results in particular regarding the classes of entanglement. More precisely, when the second register of both algorithms (i.e. the register on which a specific unitary operator act, see section 2) is initialized in the non-entangled superposition of two (separable) eigenvectors, one proves that the QPEA and QCA curves of entanglement evolution are the same up to a scalar multiplication of the parameter ϕ. One demonstrates that a local minimum is obtained and corresponds to an EPR (Einstein-Podolsky-Rosen) state and finally one proves that, up to Stochastic Local Operation and Classical Communication (SLOCC), all states, except for a few values of ϕ, are equivalent to the product of a separable state and a generalized GHZ (Greenberger-Horen-Zeilinger) state , i.e. GHZ n + 1 = 1 2 ( 00 ... 0 + 11 ... 1 ) .
- 22 August 2024
- Published by IOP Publishing in Physica Scripta
- Vol. 99 (9) , 095122
Phase sensitivity of entanglement in the Quantum Phase Estimation algorithm
We study entanglement in the steps before Quantum Fourier Transform (pre-QFT) part of the Quantum Phase Estimation and the Quantum Counting algorithms (QPEA—QCA) with the use of three entanglement detection tools. In particular we focus on the sensitivity of entanglement to the input value (the phase ϕ and the ratio of marked elements M N ) in some basic cases. One starts from numerical observations and deduce some general results in particular regarding the classes of entanglement. More precisely, when the second register of both algorithms (i.e. the register on which a specific unitary operator act, see section 2) is initialized in the non-entangled superposition of two (separable) eigenvectors, one proves that the QPEA and QCA curves of entanglement evolution are the same up to a scalar multiplication of the parameter ϕ. One demonstrates that a local minimum is obtained and corresponds to an EPR (Einstein-Podolsky-Rosen) state and finally one proves that, up to Stochastic Local Operation and Classical Communication (SLOCC), all states, except for a few values of ϕ, are equivalent to the product of a separable state and a generalized GHZ (Greenberger-Horen-Zeilinger) state , i.e. GHZ n + 1 = 1 2 ( 00 ... 0 + 11 ... 1 ) .
- 3 June 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (24) , 245303
Exploiting finite geometries for better quantum advantages in Mermin-like games
Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. The Mermin-Peres game is a simple example, demonstrating how two players can utilise shared quantum information to win a no—communication game with certainty, where classical players cannot. In this paper we look at the geometric structure behind such classical strategies, and borrow ideas from the geometry of symplectic polar spaces to maximise this quantum advantage. We introduce a new game called the Eloily game with a quantum–classical success gap of 0.2 6 ― , larger than that of the Mermin-Peres and doily games. We simulate this game in the IBM Quantum Experience and obtain a success rate of 1, beating the classical bound of 0.7 3 ― demonstrating the efficiency of the quantum strategy.
- 3 June 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (24) , 245303
Exploiting finite geometries for better quantum advantages in Mermin-like games
Quantum games embody non-intuitive consequences of quantum phenomena, such as entanglement and contextuality. The Mermin-Peres game is a simple example, demonstrating how two players can utilise shared quantum information to win a no—communication game with certainty, where classical players cannot. In this paper we look at the geometric structure behind such classical strategies, and borrow ideas from the geometry of symplectic polar spaces to maximise this quantum advantage. We introduce a new game called the Eloily game with a quantum–classical success gap of 0.2 6 ― , larger than that of the Mermin-Peres and doily games. We simulate this game in the IBM Quantum Experience and obtain a success rate of 1, beating the classical bound of 0.7 3 ― demonstrating the efficiency of the quantum strategy.
- 13 May 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (5) , 1-17
Implementing 2-qubit pseudo-telepathy games on noisy intermediate-scale quantum computers
- 13 May 2024
- Published by Springer Nature in Quantum Information Processing
- Vol. 23 (5) , 1-17
Implementing 2-qubit pseudo-telepathy games on noisy intermediate-scale quantum computers
- Open Access
- 22 March 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (14) , 145301
Maximally entangled real states and SLOCC invariants: the 3-qutrit case
The absolute values of polynomial SLOCC invariants (which always vanish on separable states) can be seen as entanglement measures. We study the case of real 3-qutrit systems and discover a new set of maximally entangled states (from the point of view of maximizing the hyperdeterminant). We also study the basic fundamental invariants and find real 3-qutrit states that maximize their absolute values. It is notable that the Aharonov state is a simultaneous maximizer for all three fundamental invariants. We also study the evaluation of these invariants on random real 3-qutrit systems and analyze their behavior using histograms and level-set plots. Finally, we show how to evaluate these invariants on any 3-qutrit state using basic matrix operations.
- 22 March 2024
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 57 (14) , 145301
Open AccessMaximally entangled real states and SLOCC invariants: the 3-qutrit case
The absolute values of polynomial SLOCC invariants (which always vanish on separable states) can be seen as entanglement measures. We study the case of real 3-qutrit systems and discover a new set of maximally entangled states (from the point of view of maximizing the hyperdeterminant). We also study the basic fundamental invariants and find real 3-qutrit states that maximize their absolute values. It is notable that the Aharonov state is a simultaneous maximizer for all three fundamental invariants. We also study the evaluation of these invariants on random real 3-qutrit systems and analyze their behavior using histograms and level-set plots. Finally, we show how to evaluate these invariants on any 3-qutrit state using basic matrix operations.
- 30 January 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
A hyperdeterminant on fermionic Fock space
Twenty years ago, Cayley's hyperdeterminant, the degree four invariant of the polynomial ring $\mathbb{C}\[\mathbb{C}^2\otimes\mathbb{C}^2\otimes \mathbb{C}^2]^{{\operatorname{SL}\_2(\mathbb{C})}^{\times 3}}$, was popularized in modern physics as it separates genuine entanglement classes in the three-qubit Hilbert space and is connected to entropy formulas for special solutions of black holes. In this note, we compute the analogous invariant on the fermionic Fock space for $N=8$, i.e., spin particles with four different locations, and show how this invariant projects to other well-known invariants in quantum information. We also give combinatorial interpretations of these formulas.- 30 January 2024
- Published by European Mathematical Society - EMS - Publishing House GmbH in Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions
A hyperdeterminant on fermionic Fock space
Twenty years ago, Cayley's hyperdeterminant, the degree four invariant of the polynomial ring $\mathbb{C}\[\mathbb{C}^2\otimes\mathbb{C}^2\otimes \mathbb{C}^2]^{{\operatorname{SL}\_2(\mathbb{C})}^{\times 3}}$, was popularized in modern physics as it separates genuine entanglement classes in the three-qubit Hilbert space and is connected to entropy formulas for special solutions of black holes. In this note, we compute the analogous invariant on the fermionic Fock space for $N=8$, i.e., spin particles with four different locations, and show how this invariant projects to other well-known invariants in quantum information. We also give combinatorial interpretations of these formulas.