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:0808.1995 · Physical Review A

Local complementation rule for continuous-variable four-mode unweighted graph states

Jing Zhang

Published Sep 4, 2008• 19 citations
arXivHTMLPDF

Abstract

The local complementation rule is applied for continuous-variable (CV) graph states in the paper, which is an elementary graph transformation rule and successive application of which generates the orbit of any graph states. The corresponding local Gaussian transformations of local complementation for four-mode unweighted graph states were found, which do not mirror the form of the local Clifford unitary of qubit exactly. This work is an important step to characterize the local Gaussian equivalence classes of CV graph states.

DOI
10.1103/physreva.78.034301

Related papers

Graphical description of local Gaussian operations for continuous-variable weighted graph states

Jing Zhang

The form of a local Clifford [LC, also called local Gaussian (LG)] operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which cannot be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.

arXiv:0810.1343•Physical Review A•Nov 4, 2008•21 citations

Local Equivalences of Graph States

Nathan Claudet

Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.

quant-pharXiv:2511.22271•Nov 28, 2025•0 citations

Local Equivalences of Graph States

Nathan Claudet

Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this manuscript a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.

•Nov 17, 2025•0 citations

Graphical description of the action of local Clifford transformations on graph states

Maarten Van den Nest, Jeroen Dehaene, Bart De Moor

We translate the action of local Clifford operations on graph states into transformations on their associated graphs, i.e., we provide transformation rules, stated in purely graph theoretical terms, which completely characterize the evolution of graph states under local Clifford operations. As we will show, there is essentially one basic rule, successive application of which generates the orbit of any graph state under local unitary operations within the Clifford group.

arXiv:quant-ph/0308151•Physical Review A•Feb 24, 2004•335 citations

Graphical rule of transforming continuous-variable graph states by local homodyne detection

Jing Zhang

Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules---local complement operation and vertex deletion (single quadrature-amplitude $\mathrm{x\ifmmode \hat{}\else \^{}\fi{}}$ measurement)---the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.

arXiv:1006.3974•Physical Review A•Sep 17, 2010•7 citations

Graphical Rigidity of Continuous Variable Graph States under Gaussian Local Transformations

Giorgio Ciliberto, Frédéric Grosshans

Multimode entangled pure Gaussian states are an essential resource for continuous variable (CV) quantum information processing. Menicucci et al. [2011] have shown how to describe them as graphs with complex adjacency matrices. Among such complex graph states (CGSs), quantum optics experimental setups straightforwardly display correlations described by purely imaginary graph states (iRGSs) whereas theoretical literature favors off-diagonal real graph state (RGS) descriptions, which actually reflect the entanglement structure in the infinite squeezing limit [Gonzalez-Arciniegas et al. 2021]. We study them beyond this ideal case, thus establishing in the finite squeezing regime an equivalence criterion for the generic case of CGSs through a graph propagating set of conditions which either finds a Gaussian Local Unitary (GLU) converting one state to another or gives a proof of impossibility if such a GLU does not exist. In the experimentally relevant case of the conversion between iRGSs and RGSs, the set of conditions results in simple relations between the topologies of the equivalent real and imaginary graphs. Finally, we show that the canonical forms of iRGSs and RGSs imply that the topology of the CV real and imaginary graph states are too rigid to admit any exact qumode local-addition analogue to the qubit complementation or qudit local-addition, thus demonstrating the non-existence of any exact qumode local-addition for these states. We however define an approximate one when the squeezing is strong enough.

quant-pharXiv:2610.31933•Oct 26, 2026•0 citations
The local complementation rule is applied for continuous-variable (CV) graph states in the paper, which is an elementary graph transformation rule and successive application of which generates the orbit of any graph states. The corresponding local Gaussian transformations of local complementation for four-mode unweighted graph states were found, which do not mirror the form of the local Clifford unitary of qubit exactly. This work is an important step to characterize the local Gaussian equivalence classes of CV graph states.
The form of a local Clifford [LC, also called local Gaussian (LG)] operation for the continuous-variable (CV) weighted graph states is presented in this paper, which is the counterpart of the LC operation of local complementation for qubit graph states. The property of the CV weighted graph states is shown, which can be expressed by the stabilizer formalism. It is distinctively different from the qubit weighted graph states, which cannot be expressed by the stabilizer formalism. The corresponding graph rule, stated in purely graph theoretical terms, is described, which completely characterizes the evolution of CV weighted graph states under this LC operation. This LC operation may be applied repeatedly on a CV weighted graph state, which can generate the infinite LC equivalent graph states of this graph state. This work is an important step to characterize the LC equivalence class of CV weighted graph states.
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this thesis a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.
Graph states form a large family of quantum states that are in one-to-one correspondence with mathematical graphs. Graph states are used in many applications, such as measurement-based quantum computation, as multipartite entangled resources. It is thus crucial to understand when two such states have the same entanglement, i.e. when they can be transformed into each other using only local operations. In this case, we say that the graph states are LU-equivalent (local unitary). If the local operations are restricted to the so-called Clifford group, we say that the graph states are LC-equivalent (local Clifford). Interestingly, a simple graph rule called local complementation fully captures LC-equivalence, in the sense that two graph states are LC-equivalent if and only if the underlying graphs are related by a sequence of local complementations. While it was once conjectured that two LU-equivalent graph states are always LC-equivalent, counterexamples do exist and local complementation fails to fully capture the entanglement of graph states. We introduce in this manuscript a generalization of local complementation that does fully capture LU-equivalence. Using this characterization, we prove the existence of an infinite strict hierarchy of local equivalences between LC- and LU-equivalence. This also leads to the design of a quasi-polynomial algorithm for deciding whether two graph states are LU-equivalent, and to a proof that two LU-equivalent graph states are LC-equivalent if they are defined on at most 19 qubits. Furthermore, we study graph states that are universal in the sense that any smaller graph state, defined on any small enough set of qubits, can be induced using only local operations. We provide bounds and an optimal, probabilistic construction.
Graphical rule, describing that any single-mode homodyne detection turns a given continuous-variable (CV) graph state into a new one, is presented. Employing two simple graphical rules---local complement operation and vertex deletion (single quadrature-amplitude $\mathrm{x\ifmmode \hat{}\else \^{}\fi{}}$ measurement)---the graphical rule for any single-mode quadrature component measurement can be obtained. The shape of CV weighted graph state may be designed and constructed easily from a given larger graph state by applying this graphical rule.
Multimode entangled pure Gaussian states are an essential resource for continuous variable (CV) quantum information processing. Menicucci et al. [2011] have shown how to describe them as graphs with complex adjacency matrices. Among such complex graph states (CGSs), quantum optics experimental setups straightforwardly display correlations described by purely imaginary graph states (iRGSs) whereas theoretical literature favors off-diagonal real graph state (RGS) descriptions, which actually reflect the entanglement structure in the infinite squeezing limit [Gonzalez-Arciniegas et al. 2021]. We study them beyond this ideal case, thus establishing in the finite squeezing regime an equivalence criterion for the generic case of CGSs through a graph propagating set of conditions which either finds a Gaussian Local Unitary (GLU) converting one state to another or gives a proof of impossibility if such a GLU does not exist. In the experimentally relevant case of the conversion between iRGSs and RGSs, the set of conditions results in simple relations between the topologies of the equivalent real and imaginary graphs. Finally, we show that the canonical forms of iRGSs and RGSs imply that the topology of the CV real and imaginary graph states are too rigid to admit any exact qumode local-addition analogue to the qubit complementation or qudit local-addition, thus demonstrating the non-existence of any exact qumode local-addition for these states. We however define an approximate one when the squeezing is strong enough.