Mehdi Mhalla
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mehdi Mhalla has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Valentin Savin
Université Grenoble Alpes, CEA-Leti, Grenoble, France
13 shared publications - Alastair A. Abbott
Univ. Grenoble Alpes, Inria, 38000 Grenoble, France
4 shared publications - Ashutosh Goswami
University of Copenhagen
4 shared publications - Julien du Crest
Université Grenoble Alpes Grenoble INP LIG F-38000 Grenoble France
4 shared publications - Simon Perdrix
Université de Lorraine, CNRS, Inria, LORIA
4 shared publications - Javier Valls
Instituto de Telecomunicaciones y Aplicaciones Multimedia, Universitat Politècnica de València, Valencia, Spain
3 shared publications
Latest Publications
- 19 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Information Theory
- Vol. 6, 138-149
A Blindness Property of the Min-Sum Decoding for the Toric Code
Kitaev’s toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to improving the error correction performance of the toric code under message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central role in both theory and practice of classical low-density parity-check codes. Here, we provide a theoretical analysis of the toric code under min-sum (MS) decoding, a message-passing decoding algorithm known to solve the maximum-likelihood decoding problem in a localized manner, for codes defined by acyclic graphs. Our analysis reveals an intrinsic limitation of the toric code, which confines the propagation of local information during the message-passing process. We show that if the unsatisfied checks of an error syndrome are at distance ≥5 from each other, then MS decoding is locally blind: the qubits in the direct neighborhood of an unsatisfied check are never aware of any other unsatisfied checks, except their direct neighbor. Moreover, we show that degeneracy is not the only cause of decoding failures for errors of weight at least 4, that is, the MS non-degenerate decoding radius is equal to 3, for any toric code of distance ≥9. Finally, complementing our theoretical analysis, we present a pre-processing method of practical relevance. The proposed method, referred to as stabiliser blowup, has linear complexity and allows correcting all (degenerate) errors of weight up to 3, providing quadratic improvement in the logical error rate performance, as compared to MS alone.
- 19 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Information Theory
- Vol. 6, 138-149
A Blindness Property of the Min-Sum Decoding for the Toric Code
Kitaev’s toric code is one of the most prominent models for fault-tolerant quantum computation, currently regarded as the leading solution for connectivity constrained quantum technologies. Significant effort has been recently devoted to improving the error correction performance of the toric code under message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central role in both theory and practice of classical low-density parity-check codes. Here, we provide a theoretical analysis of the toric code under min-sum (MS) decoding, a message-passing decoding algorithm known to solve the maximum-likelihood decoding problem in a localized manner, for codes defined by acyclic graphs. Our analysis reveals an intrinsic limitation of the toric code, which confines the propagation of local information during the message-passing process. We show that if the unsatisfied checks of an error syndrome are at distance ≥5 from each other, then MS decoding is locally blind: the qubits in the direct neighborhood of an unsatisfied check are never aware of any other unsatisfied checks, except their direct neighbor. Moreover, we show that degeneracy is not the only cause of decoding failures for errors of weight at least 4, that is, the MS non-degenerate decoding radius is equal to 3, for any toric code of distance ≥9. Finally, complementing our theoretical analysis, we present a pre-processing method of practical relevance. The proposed method, referred to as stabiliser blowup, has linear complexity and allows correcting all (degenerate) errors of weight up to 3, providing quadratic improvement in the logical error rate performance, as compared to MS alone.
- Open Access
- 26 July 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , L032020
Quantum query complexity of Boolean functions under indefinite causal order
The standard model of quantum circuits assumes operations are applied in a fixed sequential “causal” order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant attention. The quantum switch, for example, uses a quantum system to coherently control the order of operations. Several ad hoc computational and information-theoretical advantages have been demonstrated, raising questions as to whether advantages can be obtained in a more unified complexity theoretic framework. In this paper, we approach this problem by studying the query complexity of Boolean functions under general higher-order quantum computations. To this end, we generalize the framework of query complexity from quantum circuits to quantum supermaps to compare different models on an equal footing. We show that the recently introduced class of quantum circuits with quantum control of causal order cannot lead to any reduction in query complexity, and that any potential advantage arising from causally indefinite supermaps can be bounded by the polynomial method, as is the case with quantum circuits. Nevertheless, we find some functions for which the minimum error with which they can be computed using two queries is strictly lower when exploiting causally indefinite supermaps.
- 26 July 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , L032020
Open AccessQuantum query complexity of Boolean functions under indefinite causal order
The standard model of quantum circuits assumes operations are applied in a fixed sequential “causal” order. In recent years, the possibility of relaxing this constraint to obtain causally indefinite computations has received significant attention. The quantum switch, for example, uses a quantum system to coherently control the order of operations. Several ad hoc computational and information-theoretical advantages have been demonstrated, raising questions as to whether advantages can be obtained in a more unified complexity theoretic framework. In this paper, we approach this problem by studying the query complexity of Boolean functions under general higher-order quantum computations. To this end, we generalize the framework of query complexity from quantum circuits to quantum supermaps to compare different models on an equal footing. We show that the recently introduced class of quantum circuits with quantum control of causal order cannot lead to any reduction in query complexity, and that any potential advantage arising from causally indefinite supermaps can be bounded by the polynomial method, as is the case with quantum circuits. Nevertheless, we find some functions for which the minimum error with which they can be computed using two queries is strictly lower when exploiting causally indefinite supermaps.
- 12 July 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (1) , 012438
Factory-based fault-tolerant preparation of quantum polar codes encoding one logical qubit
A fault-tolerant way to prepare logical code states of codes, i.e., quantum polar codes encoding one qubit, was recently proposed. The fault tolerance therein is guaranteed by an error detection gadget, where, if an error is detected during the preparation, one entirely discards the preparation. Due to error detection, the preparation is probabilistic and its success rate, referred to as the preparation rate, decreases rapidly with the code length, preventing the preparation of code states of large code- lengths. In this paper, to improve the preparation rate, we consider a factory preparation of code states, where one attempts to prepare several copies of code states in parallel. Using an extra scheduling step, we can avoid discarding the preparation entirely every time an error is detected, hence, achieving an increased preparation rate in turn. We further provide a theoretical method to estimate preparation and logical error rates of codes, prepared using factory preparation, which is shown to tightly fit the Monte Carlo simulation-based numerical results. Therefore, our theoretical method is useful for providing estimates for large code lengths, where Monte Carlo simulations are practically not feasible. Our numerical results, for a circuit-level depolarizing noise model, indicate that the preparation rate increases significantly, especially for large code-length . For example, for , it increases from to for a practically interesting physical error rate . Remarkably, a code with achieves logical error rates around and for and , respectively. This corresponds to an improvement of about three orders of magnitude compared to a surface code with similar code length and minimum distance, thus showing the promise of the proposed scheme for large-scale fault-tolerant quantum computing.- 12 July 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 110 (1) , 012438
Factory-based fault-tolerant preparation of quantum polar codes encoding one logical qubit
A fault-tolerant way to prepare logical code states of codes, i.e., quantum polar codes encoding one qubit, was recently proposed. The fault tolerance therein is guaranteed by an error detection gadget, where, if an error is detected during the preparation, one entirely discards the preparation. Due to error detection, the preparation is probabilistic and its success rate, referred to as the preparation rate, decreases rapidly with the code length, preventing the preparation of code states of large code- lengths. In this paper, to improve the preparation rate, we consider a factory preparation of code states, where one attempts to prepare several copies of code states in parallel. Using an extra scheduling step, we can avoid discarding the preparation entirely every time an error is detected, hence, achieving an increased preparation rate in turn. We further provide a theoretical method to estimate preparation and logical error rates of codes, prepared using factory preparation, which is shown to tightly fit the Monte Carlo simulation-based numerical results. Therefore, our theoretical method is useful for providing estimates for large code lengths, where Monte Carlo simulations are practically not feasible. Our numerical results, for a circuit-level depolarizing noise model, indicate that the preparation rate increases significantly, especially for large code-length . For example, for , it increases from to for a practically interesting physical error rate . Remarkably, a code with achieves logical error rates around and for and , respectively. This corresponds to an improvement of about three orders of magnitude compared to a surface code with similar code length and minimum distance, thus showing the promise of the proposed scheme for large-scale fault-tolerant quantum computing.- Open Access
- 17 June 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1376
Improving social welfare in non-cooperative games with different types of quantum resources
We investigate what quantum advantages can be obtained in multipartite non-cooperative games by studying how different types of quantum resources can lead to new Nash equilibria and improve social welfare — a measure of the quality of an equilibrium. Two different quantum settings are analysed: a first, in which players are given direct access to an entangled quantum state, and a second, which we introduce here, in which they are only given classical advice obtained from quantum devices. For a given game G , these two settings give rise to different equilibria characterised by the sets of equilibrium correlations Q corr ( G ) and Q ( G ) , respectively. We show that Q ( G ) ⊆ Q corr ( G ) , and by exploiting the self-testing property of some correlations, that the inclusion is strict for some games G . We make use of SDP optimisation techniques to study how these quantum resources can improve social welfare, obtaining upper and lower bounds on the social welfare reachable in each setting. We investigate, for several games involving conflicting interests, how the social welfare depends on the bias of the game and improve upon a separation that was previously obtained using pseudo-telepathic solutions.
- 17 June 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1376
Open AccessImproving social welfare in non-cooperative games with different types of quantum resources
We investigate what quantum advantages can be obtained in multipartite non-cooperative games by studying how different types of quantum resources can lead to new Nash equilibria and improve social welfare — a measure of the quality of an equilibrium. Two different quantum settings are analysed: a first, in which players are given direct access to an entangled quantum state, and a second, which we introduce here, in which they are only given classical advice obtained from quantum devices. For a given game G , these two settings give rise to different equilibria characterised by the sets of equilibrium correlations Q corr ( G ) and Q ( G ) , respectively. We show that Q ( G ) ⊆ Q corr ( G ) , and by exploiting the self-testing property of some correlations, that the inclusion is strict for some games G . We make use of SDP optimisation techniques to study how these quantum resources can improve social welfare, obtaining upper and lower bounds on the social welfare reachable in each setting. We investigate, for several games involving conflicting interests, how the social welfare depends on the bias of the game and improve upon a separation that was previously obtained using pseudo-telepathic solutions.
- Open Access
- 2 May 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1334
Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap between algorithmic solutions and hardware limitations, we introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. The proposed post-processing, referred to as check-agnosia, is inspired by stabilizer-inactivation, while considerably reducing the required hardware resources, and providing enough flexibility to allow different message-passing schedules and hardware architectures. We carry out a detailed analysis for a set of Pareto architectures with different tradeoffs between latency and power consumption, derived from the results of implemented designs on an FPGA board. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations. In the process, we also demonstrate the practical implications of the recently introduced t-covering layers and random-order layered scheduling.
- 2 May 2024
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 8, 1334
Open AccessCheck-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap between algorithmic solutions and hardware limitations, we introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. The proposed post-processing, referred to as check-agnosia, is inspired by stabilizer-inactivation, while considerably reducing the required hardware resources, and providing enough flexibility to allow different message-passing schedules and hardware architectures. We carry out a detailed analysis for a set of Pareto architectures with different tradeoffs between latency and power consumption, derived from the results of implemented designs on an FPGA board. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations. In the process, we also demonstrate the practical implications of the recently introduced t-covering layers and random-order layered scheduling.
- Open Access
Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap between algorithmic solutions and hardware limitations, we introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. The proposed post-processing, referred to as check-agnosia, is inspired by stabilizer-inactivation, while considerably reducing the required hardware resources, and providing enough flexibility to allow different message-passing schedules and hardware architectures. We carry out a detailed analysis for a set of Pareto architectures with different tradeoffs between latency and power consumption, derived from the results of implemented designs on an FPGA board. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations. In the process, we also demonstrate the practical implications of the recently introduced t-covering layers and random-order layered scheduling.
Open AccessCheck-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes
The inherent degeneracy of quantum low-density parity-check codes poses a challenge to their decoding, as it significantly degrades the error-correction performance of classical message-passing decoders. To improve their performance, a post-processing algorithm is usually employed. To narrow the gap between algorithmic solutions and hardware limitations, we introduce a new post-processing algorithm with a hardware-friendly orientation, providing error correction performance competitive to the state-of-the-art techniques. The proposed post-processing, referred to as check-agnosia, is inspired by stabilizer-inactivation, while considerably reducing the required hardware resources, and providing enough flexibility to allow different message-passing schedules and hardware architectures. We carry out a detailed analysis for a set of Pareto architectures with different tradeoffs between latency and power consumption, derived from the results of implemented designs on an FPGA board. We show that latency values close to one microsecond can be obtained on the FPGA board, and provide evidence that much lower latency values can be obtained for ASIC implementations. In the process, we also demonstrate the practical implications of the recently introduced t-covering layers and random-order layered scheduling.
- 19 December 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 68 (1) , 1-26
A Formalization of the CHSH Inequality and Tsirelson’s Upper-bound in Isabelle/HOL
- 19 December 2023
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 68 (1) , 1-26
A Formalization of the CHSH Inequality and Tsirelson’s Upper-bound in Isabelle/HOL
- 11 October 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (4) , 042605
Fault-tolerant preparation of quantum polar codes encoding one logical qubit
This paper explores an approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as codes. First, we show that a subfamily of codes is equivalent to the well-known family of Shor codes. Moreover, we show that codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of code states. We give a recursive procedure to prepare a code state, based on two-qubit Pauli measurements only. The procedure is not by itself fault-tolerant; however, the measurement operations therein provide redundant classical bits, which can be advantageously used for error detection. Fault tolerance is then achieved by combining the proposed recursive procedure with an error detection method. Finally, we consider the fault-tolerant error correction of codes. We use Steane error correction, which incorporates the proposed fault-tolerant code state preparation procedure. We provide numerical estimates of the logical error rates for and Shor codes of length 16 and 64 qubits, assuming a circuit-level depolarizing noise model. Remarkably, the code of length 64 qubits achieves a logical error rate very close to for the physical error rate , therefore demonstrating the potential of the proposed polar-codes-based approach to FTQC.- 11 October 2023
- Published by American Physical Society (APS) in Physical Review A
- Vol. 108 (4) , 042605
Fault-tolerant preparation of quantum polar codes encoding one logical qubit
This paper explores an approach to fault-tolerant quantum computing (FTQC), relying on quantum polar codes. We consider quantum polar codes of Calderbank-Shor-Steane type, encoding one logical qubit, which we refer to as codes. First, we show that a subfamily of codes is equivalent to the well-known family of Shor codes. Moreover, we show that codes significantly outperform Shor codes, of the same length and minimum distance. Second, we consider the fault-tolerant preparation of code states. We give a recursive procedure to prepare a code state, based on two-qubit Pauli measurements only. The procedure is not by itself fault-tolerant; however, the measurement operations therein provide redundant classical bits, which can be advantageously used for error detection. Fault tolerance is then achieved by combining the proposed recursive procedure with an error detection method. Finally, we consider the fault-tolerant error correction of codes. We use Steane error correction, which incorporates the proposed fault-tolerant code state preparation procedure. We provide numerical estimates of the logical error rates for and Shor codes of length 16 and 64 qubits, assuming a circuit-level depolarizing noise model. Remarkably, the code of length 64 qubits achieves a logical error rate very close to for the physical error rate , therefore demonstrating the potential of the proposed polar-codes-based approach to FTQC.- Open Access
- 4 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Improved Rate Fault-Tolerant Preparation of Q1 Code-States
A fault tolerant way to prepare logical code-states of $\mathcal{Q}_{1}$ codes, i.e., quantum polar codes encoding one qubit, has been recently proposed. The fault tolerance is guaranteed with the help of an error detection gadget, where if an error is detected, one declares a preparation failure and discards entirely the preparation. This makes the preparation probabilistic, whose success rate is referred to as the preparation rate. In this work, we consider a factory preparation procedure, where one attempts to prepare several copies of $\mathcal{Q}_{1}$ code-states in parallel. With the help of an extra scheduling step, we can avoid discarding the preparation entirely, every time an error is detected, hence, we may achieve an increased preparation rate. Our numerical simulations, for a circuit-level depolarizing model, suggest that the preparation rate increases significantly, especially for large code-lengths N. For example, for N=256, it increases from 2% to 26% for a practically interesting physical error rate of p=$10^{-3}$. Remarkably, a $\mathcal{Q}_{1}$ code of length N=256 achieves logical error rates around $10^{-10}$ and $10^{-15}$, for physical error rates of p=$10^{-3}$ and p=3×$10^{-4}$, respectively, thus showing that factory preparation may allow to access the error protection provided by the larger $\mathcal{Q}_{1}$ code-states.- 4 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Open AccessImproved Rate Fault-Tolerant Preparation of Q1 Code-States
A fault tolerant way to prepare logical code-states of $\mathcal{Q}_{1}$ codes, i.e., quantum polar codes encoding one qubit, has been recently proposed. The fault tolerance is guaranteed with the help of an error detection gadget, where if an error is detected, one declares a preparation failure and discards entirely the preparation. This makes the preparation probabilistic, whose success rate is referred to as the preparation rate. In this work, we consider a factory preparation procedure, where one attempts to prepare several copies of $\mathcal{Q}_{1}$ code-states in parallel. With the help of an extra scheduling step, we can avoid discarding the preparation entirely, every time an error is detected, hence, we may achieve an increased preparation rate. Our numerical simulations, for a circuit-level depolarizing model, suggest that the preparation rate increases significantly, especially for large code-lengths N. For example, for N=256, it increases from 2% to 26% for a practically interesting physical error rate of p=$10^{-3}$. Remarkably, a $\mathcal{Q}_{1}$ code of length N=256 achieves logical error rates around $10^{-10}$ and $10^{-15}$, for physical error rates of p=$10^{-3}$ and p=3×$10^{-4}$, respectively, thus showing that factory preparation may allow to access the error protection provided by the larger $\mathcal{Q}_{1}$ code-states. - Open Access
Layered Decoding of Quantum LDPC Codes
We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is of independent interest as it helps relieve the high error floor typical of message-passing decoders on quantum codes for both layered and serial decoding without the need for post-processing.
Open AccessLayered Decoding of Quantum LDPC Codes
We address the problem of performing message-passing-based decoding of quantum LDPC codes under hardware latency limitations. We propose a novel way to do layered decoding that suits quantum constraints and outperforms flooded scheduling, the usual scheduling on parallel architectures. A generic construction is given to construct layers of hypergraph product codes. In the process, we introduce two new notions, t-covering layers which is a generalization of the usual layer decomposition, and a new scheduling called random order scheduling. Numerical simulations show that the random ordering is of independent interest as it helps relieve the high error floor typical of message-passing decoders on quantum codes for both layered and serial decoding without the need for post-processing.