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:2308.10810 · Advanced Quantum Technologies

Evaluating Pauli Errors on Cluster States by Weighted Distances

Pak Shen Choong, Davide Girolami

Published Apr 18, 2024• 1 citation
arXivHTMLPDF

Abstract

Abstract The problem of evaluating the differences between quantum states before and after being affected by errors encoded in unitary transformations is addressed. Standard distance functions, e.g., the Bures length, are not fully adequate for such a task. Weighted distances are instead the appropriate information measures to quantify the distinguishability of multipartite states. Here, the previously introduced weighted Bures length and the newly defined weighted Hilbert‐Schmidt distance are employed to quantify how much single‐qubit Pauli errors alter cluster states. For both types of weighted distances, it is found that different errors of the same dimension change cluster states in a different way, i.e., their detectability is in general different. Indeed, they transform an ideal cluster state into a state whose weighted distances from the input depends on the specific chosen Pauli rotation, as well as the position of the affected qubit in the graph related to the cluster state. As these features are undetected by using standard distances, the study proves the usefulness of weighted distances to monitor key but elusive properties of many‐body quantum systems.

DOI
10.1002/qute.202300267

Related papers

Quantifying the Difference between Many-Body Quantum States

Davide Girolami, Fabio Anzà

The quantum state overlap is the textbook measure of the difference between two quantum states. Yet, it is inadequate to compare the complex configurations of many-body systems. The problem is inherited by the widely employed quantum state fidelity and related distances. We introduce the weighted distances, a new class of information-theoretic measures that overcome these limitations. They quantify how hard it is to discriminate between two quantum states of many particles, factoring in the structure of the required measurement apparatus. Therefore, they can be used to evaluate both the theoretical and the experimental performances of complex quantum devices. We also show that the newly defined "weighted Bures length" between the input and output states of a quantum process is a lower bound to the experimental cost of the transformation. The result uncovers an exact quantum limit to our ability to convert physical resources into computational ones.

arXiv:2012.05619•Physical Review Letters•Apr 27, 2021•12 citations

Weighted Bures length uncovers quantum state sensitivity

Paweł Kurzyński

The unitarity of quantum evolutions implies that an overlap between two initial states does not change in time. This property is commonly believed to explain the apparent lack of state sensitivity in quantum theory, a feature that is prevailing in classical chaotic systems. However, classical state sensitivity is based on a distance between two trajectories in phase space which is a completely different mathematical concept than an overlap between two vectors in Hilbert space. It is possible that state sensitivity in quantum theory can be detected with the help of some special metric. Here we show that the recently introduced Weighted Bures length achieves this task. We numerically investigate a unitary cellular automaton of N interacting qubits and analyze how a single-qubit perturbation affects the evolution of WBL between the unperturbed and perturbed states. We observe a linear growth of WBL if the qubits are arranged into a cyclic graph and an exponential growth if they are arranged into a random bipartite graph.

arXiv:2106.14081•Physical review. E•Nov 18, 2021•3 citations

Quantum-data-adaptive clustering algorithm

Meng-Ting Yang, Yu Huang, Lu Yan +1 more

Abstract Quantum state clustering provides a powerful tool for quantum information processing. This paper focuses on the classification of single-qubit pure and mixed states via clustering algorithms, and discovers that the classical K -means algorithm has two limitations in clustering quantum states: the Euclidean distance cannot accurately reflect the similarity between quantum states, and the centroid update based on the arithmetic mean frequently fails to yield valid quantum states. To address these issues, we propose two distance metrics for quantum states: the dynamic distance and the Bloch distance, and adopt the K -medoids method to update the centroid, ensuring that the cluster center always remains a valid quantum state, thereby designing a quantum-data-adaptive clustering algorithm. Experimental results show that the dynamic distance achieves a clustering accuracy as high as 91.4 % , but at the cost of higher computational complexity. In contrast, the Bloch distance significantly reduces computational complexity while maintaining clustering performance comparable to that of the dynamic distance, achieving a clustering accuracy of 87.4 % . This paper provides a practical method for achieving efficient and reliable clustering of single-qubit quantum states.

Laser Physics Letters•Jul 1, 2026•0 citations

Multiparty entanglement in graph states

M. Hein, Jens Eisert, Hans J. Briegel

Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.

arXiv:quant-ph/0307130•Physical Review A•Jun 9, 2004•1,119 citations

Transformer-QEC: Quantum Error Correction Code Decoding with Transferable Transformers

Hanrui Wang, Pengyu Liu, Kevin Shao +5 more

Quantum computing has the potential to solve problems that are intractable for classical systems, yet the high error rates in contemporary quantum devices often exceed tolerable limits for useful algorithm execution. Quantum Error Correction (QEC) mitigates this by employing redundancy, distributing quantum information across multiple data qubits and utilizing syndrome qubits to monitor their states for errors. The syndromes are subsequently interpreted by a decoding algorithm to identify and correct errors in the data qubits. This task is complex due to the multiplicity of error sources affecting both data and syndrome qubits as well as syndrome extraction operations. Additionally, identical syndromes can emanate from different error sources, necessitating a decoding algorithm that evaluates syndromes collectively. Although machine learning (ML) decoders such as multi-layer perceptrons (MLPs) and convolutional neural networks (CNNs) have been proposed, they often focus on local syndrome regions and require retraining when adjusting for different code distances. We introduce a transformer-based QEC decoder which employs self-attention to achieve a global receptive field across all input syndromes. It incorporates a mixed loss training approach, combining both local physical error and global parity label losses. Moreover, the transformer architecture's inherent adaptability to variable-length inputs allows for efficient transfer learning, enabling the decoder to adapt to varying code distances without retraining. Evaluation on six code distances and ten different error configurations demonstrates that our model consistently outperforms non-ML decoders, such as Union Find (UF) and Minimum Weight Perfect Matching (MWPM), and other ML decoders, thereby achieving best logical error rates. Moreover, the transfer learning can save over 10x of training cost.

arXiv:2311.16082•Nov 27, 2023•37 citations

Sector length distributions of recursively definable graph states through analytic combinatorics

Eloïc Vallée, Kenneth Goodenough, Paul E. Gunnells +2 more

The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the $k$-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.

quant-pharXiv:2604.09766•Apr 14, 2026•2 citations
Abstract The problem of evaluating the differences between quantum states before and after being affected by errors encoded in unitary transformations is addressed. Standard distance functions, e.g., the Bures length, are not fully adequate for such a task. Weighted distances are instead the appropriate information measures to quantify the distinguishability of multipartite states. Here, the previously introduced weighted Bures length and the newly defined weighted Hilbert‐Schmidt distance are employed to quantify how much single‐qubit Pauli errors alter cluster states. For both types of weighted distances, it is found that different errors of the same dimension change cluster states in a different way, i.e., their detectability is in general different. Indeed, they transform an ideal cluster state into a state whose weighted distances from the input depends on the specific chosen Pauli rotation, as well as the position of the affected qubit in the graph related to the cluster state. As these features are undetected by using standard distances, the study proves the usefulness of weighted distances to monitor key but elusive properties of many‐body quantum systems.
The quantum state overlap is the textbook measure of the difference between two quantum states. Yet, it is inadequate to compare the complex configurations of many-body systems. The problem is inherited by the widely employed quantum state fidelity and related distances. We introduce the weighted distances, a new class of information-theoretic measures that overcome these limitations. They quantify how hard it is to discriminate between two quantum states of many particles, factoring in the structure of the required measurement apparatus. Therefore, they can be used to evaluate both the theoretical and the experimental performances of complex quantum devices. We also show that the newly defined "weighted Bures length" between the input and output states of a quantum process is a lower bound to the experimental cost of the transformation. The result uncovers an exact quantum limit to our ability to convert physical resources into computational ones.
The unitarity of quantum evolutions implies that an overlap between two initial states does not change in time. This property is commonly believed to explain the apparent lack of state sensitivity in quantum theory, a feature that is prevailing in classical chaotic systems. However, classical state sensitivity is based on a distance between two trajectories in phase space which is a completely different mathematical concept than an overlap between two vectors in Hilbert space. It is possible that state sensitivity in quantum theory can be detected with the help of some special metric. Here we show that the recently introduced Weighted Bures length achieves this task. We numerically investigate a unitary cellular automaton of N interacting qubits and analyze how a single-qubit perturbation affects the evolution of WBL between the unperturbed and perturbed states. We observe a linear growth of WBL if the qubits are arranged into a cyclic graph and an exponential growth if they are arranged into a random bipartite graph.
Abstract Quantum state clustering provides a powerful tool for quantum information processing. This paper focuses on the classification of single-qubit pure and mixed states via clustering algorithms, and discovers that the classical K -means algorithm has two limitations in clustering quantum states: the Euclidean distance cannot accurately reflect the similarity between quantum states, and the centroid update based on the arithmetic mean frequently fails to yield valid quantum states. To address these issues, we propose two distance metrics for quantum states: the dynamic distance and the Bloch distance, and adopt the K -medoids method to update the centroid, ensuring that the cluster center always remains a valid quantum state, thereby designing a quantum-data-adaptive clustering algorithm. Experimental results show that the dynamic distance achieves a clustering accuracy as high as 91.4 % , but at the cost of higher computational complexity. In contrast, the Bloch distance significantly reduces computational complexity while maintaining clustering performance comparable to that of the dynamic distance, achieving a clustering accuracy of 87.4 % . This paper provides a practical method for achieving efficient and reliable clustering of single-qubit quantum states.
Graph states are multiparticle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multiparty quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multiparticle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimensions, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphisms.
Quantum computing has the potential to solve problems that are intractable for classical systems, yet the high error rates in contemporary quantum devices often exceed tolerable limits for useful algorithm execution. Quantum Error Correction (QEC) mitigates this by employing redundancy, distributing quantum information across multiple data qubits and utilizing syndrome qubits to monitor their states for errors. The syndromes are subsequently interpreted by a decoding algorithm to identify and correct errors in the data qubits. This task is complex due to the multiplicity of error sources affecting both data and syndrome qubits as well as syndrome extraction operations. Additionally, identical syndromes can emanate from different error sources, necessitating a decoding algorithm that evaluates syndromes collectively. Although machine learning (ML) decoders such as multi-layer perceptrons (MLPs) and convolutional neural networks (CNNs) have been proposed, they often focus on local syndrome regions and require retraining when adjusting for different code distances. We introduce a transformer-based QEC decoder which employs self-attention to achieve a global receptive field across all input syndromes. It incorporates a mixed loss training approach, combining both local physical error and global parity label losses. Moreover, the transformer architecture's inherent adaptability to variable-length inputs allows for efficient transfer learning, enabling the decoder to adapt to varying code distances without retraining. Evaluation on six code distances and ten different error configurations demonstrates that our model consistently outperforms non-ML decoders, such as Union Find (UF) and Minimum Weight Perfect Matching (MWPM), and other ML decoders, thereby achieving best logical error rates. Moreover, the transfer learning can save over 10x of training cost.
The sector length distribution or Shor-Laflamme distribution (SLD) of quantum states is governed by the kkk-body correlations amongst the different systems, and has been used to study entanglement and error correction. A succinct description of a quantum state's SLD can be obtained by representing it through the coefficients of an appropriate weight enumerator polynomial, yielding bounds on fidelity under depolarizing noise and on multipartite entanglement. However, such expressions quickly grow out of hand and are generally difficult to achieve analytically, reflecting the computational hardness of the SLD. We sidestep this problem and, instead of a single state's SLDs, encode a family of quantum state's SLD as a generating function. We then find closed-form expressions for a large class of graph states which we call `recursively definable' and which include many common graphs such as path graphs, cycle graphs, star graphs, grid graphs, and more. As direct corollary, we obtain analytical expressions for such graph states' concentratable entanglement, bounds on their depolarizing fidelity, and a multipartite entanglement criterion. Our work opens up the use of generating functions and more generally analytic combinatorics to solve problems in quantum information theory.