Entangled Graph Research Articles

Head pose estimation with particle swarm optimization‐based contrastive learning and multimodal entangled GCN

AbstractHead pose estimation is an especially challenging task due to the complexity nonlinear mapping from 2D feature space to 3D pose space. To address the above issue, this paper presents a novel and efficient head pose estimation framework based on particle swarm optimized contrastive learning and multimodal entangled graph convolution network. Firstly, a new network, the region and difference‐aware feature pyramid network (RD‐FPN), is proposed for 2D keypoints detection to alleviate the background interference and enhance the feature expressiveness. Then, particle swarm optimized contrastive learning is constructed to alternatively match 2D and 3D keypoints, which takes the multimodal keypoints matching accuracy as the optimization objective, while considering the similarity of cross‐modal positive and negative sample pairs from contrastive learning as a local contrastive constraint. Finally, multimodal entangled graph convolution network is designed to enhance the ability of establishing geometric relationships between keypoints and head pose angles based on second‐order bilinear attention, in which point‐edge attention is introduced to improve the representation of geometric features between multimodal keypoints. Compared with other methods, the average error of our method is reduced by 8.23%, indicating the accuracy, generalization, and efficiency of our method on the 300W‐LP, AFLW2000, BIWI datasets.

General stabilizer approach for constructing highly entangled graph states

Highly entangled multipartite states such as $k$-uniform ($k$-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications. However, there does not yet exist a complete classification of such states, and much remains unknown about their entanglement structure. Here we substantially broaden the class of known $k$-UNI and AME states by introducing a method for explicitly constructing such states that combines classical error correcting codes and qudit graph states. This method in fact constitutes a general recipe for obtaining multipartitite entangled states from classical codes. Furthermore, we show that at least for a large subset of the class of $k$-UNI states that we present, the states are inequivalent under stochastic local operations and classical communication. This subset is defined by an iterative procedure for constructing a hierarchy of $k$-UNI graph states.

A Heuristic Remote Entanglement Distribution Algorithm on Memory-Limited Quantum Paths

Remote entanglement distribution plays a crucial role in large-scale quantum networks, and the key enabler for entanglement distribution is quantum routers (or repeaters) that can extend the entanglement transmission distance. However, the performance of quantum routers is far from perfect yet. Amongst the causes, the limited quantum memories in quantum routers largely affect the rate and efficiency of entanglement distribution. To overcome this challenge, this paper presents a new modeling for the maximization of entanglement distribution rate (EDR) on a memory-limited path, which is then transformed into entanglement generation and swapping sub-problems. We propose a greedy algorithm for short-distance entanglement generation so that the quantum memories can be efficiently used. As for the entanglement swapping sub-problem, we model it using an Entanglement Graph (EG), whose solution is yet found to be at least NP-complete. In light of it, we propose a heuristic algorithm by dividing the original EG into several sub-problems, each of which can be solved using dynamic programming (DP) in polynomial time. By conducting simulations, the results show that our proposed scheme can achieve a high EDR, and the developed algorithm has a polynomial-time upper bound and reasonable average runtime complexity.

A quantum processor based on coherent transport of entangled atom arrays

The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is key for building scalable quantum information systems1,2. In most state-of-the-art approaches, qubits interact locally, constrained by the connectivity associated with their fixed spatial layout. Here we demonstrate a quantum processor with dynamic, non-local connectivity, in which entangled qubits are coherently transported in a highly parallel manner across two spatial dimensions, between layers of single- and two-qubit operations. Our approach makes use of neutral atom arrays trapped and transported by optical tweezers; hyperfine states are used for robust quantum information storage, and excitation into Rydberg states is used for entanglement generation3–5. We use this architecture to realize programmable generation of entangled graph states, such as cluster states and a seven-qubit Steane code state6,7. Furthermore, we shuttle entangled ancilla arrays to realize a surface code state with thirteen data and six ancillary qubits8 and a toric code state on a torus with sixteen data and eight ancillary qubits9. Finally, we use this architecture to realize a hybrid analogue–digital evolution2 and use it for measuring entanglement entropy in quantum simulations10–12, experimentally observing non-monotonic entanglement dynamics associated with quantum many-body scars13,14. Realizing a long-standing goal, these results provide a route towards scalable quantum processing and enable applications ranging from simulation to metrology.

Photonic resource state generation from a minimal number of quantum emitters

Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.

Experimental self-testing for photonic graph states.

Graph states-one of the most representative families of multipartite entangled states-are important resources for multiparty quantum communication, quantum error correction, and quantum computation. Device-independent certification of highly entangled graph states plays a prominent role in quantum information processing tasks. Here we have experimentally demonstrated device-independent certification for multipartite graph states by adopting the robust self-testing scheme based on scalable Bell inequalities. Specifically, the prepared multi-qubit Greenberger-Horne-Zeilinger (GHZ) states and linear cluster states achieve a high degree of Bell violation, which are beyond the nontrivial bounds of the robust self-testing scheme. Furthermore, our work paves the way to the device-independent certification of complex multipartite quantum states.

Hard limits on the postselectability of optical graph states

Coherent control of large entangled graph states enables a wide variety of quantum information processing tasks, including error-corrected quantum computation. The linear optical approach offers excellent control and coherence, but today most photon sources and entangling gates—required for the construction of large graph states—are probabilistic and rely on postselection. In this work, we provide proofs and heuristics to aid experimental design using postselection. We introduce a versatile design rule for postselectable experiments: drawn as a graph, with qubit as vertices and gates and photon-pair sources as edges, an experiment may only contain cycles with an odd number of sources. We analyse experiments that use photons from postselected photon-pair sources, and lower bound the number of accessible classes of graph state entanglement in the non-degenerate case—graph state entanglement classes that contain a tree are are always accessible. The proportion of graph states accessible by postselection shrinks rapidly, however. We list accessible classes for various resource states up to 9 qubits. Finally, we apply these methods to near-term multi-photon experiments.

Photonic graph state generation from quantum dots and color centers for quantum communications

Highly entangled graph states of photons have applications in universal quantum computing and in quantum communications. In the latter context, they have been proposed as the key ingredient in the establishment of long-distance entanglement across quantum repeater networks. Recently, a general deterministic approach to generate repeater graph states from quantum emitters was given. However, a detailed protocol for the generation of such states from realistic systems is still needed in order to guide experiments. Here, we provide such explicit protocols for the generation of repeater graph states from two types of quantum emitters: NV centers in diamond and self-assembled quantum dots. A crucial element of our designs is an efficient controlled-Z gate between the emitter and a nuclear spin, used as an ancilla qubit. Additionally, a fast protocol for using pairs of exchange-coupled quantum dots to produce repeater graph states is described. Our focus is on near-term experiments feasible with existing experimental capabilities.

Frequency Control of Single Quantum Emitters in Integrated Photonic Circuits.

Generating entangled graph states of qubits requires high entanglement rates with efficient detection of multiple indistinguishable photons from separate qubits. Integrating defect-based qubits into photonic devices results in an enhanced photon collection efficiency, however, typically at the cost of a reduced defect emission energy homogeneity. Here, we demonstrate that the reduction in defect homogeneity in an integrated device can be partially offset by electric field tuning. Using photonic device-coupled implanted nitrogen vacancy (NV) centers in a GaP-on-diamond platform, we demonstrate large field-dependent tuning ranges and partial stabilization of defect emission energies. These results address some of the challenges of chip-scale entanglement generation.

Voltage Sychronization in Arrays of Fractional-Order Energy Storage Elements

In this paper, the balancing of a collection of electric energy storage devices is considered. Specific devices discussed are capacitors, supercapacitors, and batteries. The balancing problem is formulated as a complex network with dynamic nodes. The connection problem is approached from a graph theory viewpoint and solved by using homogeneous or entangled graphs. The utility of this approach is demonstrated with several examples

Classification of 4-qubit Entangled Graph States According to Bipartite Entanglement, Multipartite Entanglement and Non-local Properties

We use concurrence to study bipartite entanglement, Meyer-Wallach measure and its generalizations to study multi-partite entanglement and MABK and SASA inequalities to study the non-local properties of the 4-qubit entangled graph states, quantitatively. Then, we present 3 classifications, each one in accordance with one of the aforementioned properties. We also observe that the classification according to multipartite entanglement does exactly coincide with that according to nonlocal properties, but does not match with that according to bipartite entanglement. This observation signifies the fact that non-locality and multipartite entanglement enjoy the same basic underlying principles, while bipartite entanglement may not reveal the non-locality issue in its entirety.

Entangled graphs: a classification of four-qubit entanglement

We use the concept of \textit{entangled graphs} with weighted edges to present a classification for four-qubit entanglement which is based neither on the LOCC nor the SLOCC. Entangled graphs, first introduced by Plesch et al. [Phys. Rev. A 67, (2003) 012322], are structures such that each qubit of a multi-qubit system is represented as a vertex and an edge between two vertices denotes bipartite entanglement between the corresponding qubits. Our classification is based on the use of generalized Schmidt decomposition of pure states of multi-qubit systems. We show that for every possible entangled graph one can find a pure state such that the reduced entanglement of each pair, measured by concurrence, represents the weight of the corresponding edge in the graph. We also use the concept of tripartite and quadripartite concurrences as a proper measure of global entanglement of the states. In this case a circle including the graph indicates the presence of global entanglement.

Ideal geometry of periodic entanglements

Three-dimensional entanglements, including knots, knotted graphs, periodic arrays of woven filaments and interpenetrating nets, form an integral part of structure analysis because they influence various physical properties. Ideal embeddings of these entanglements give insight into identification and classification of the geometry and physically relevant configurations in vivo . This paper introduces an algorithm for the tightening of finite, periodic and branched entanglements to a least energy form. Our algorithm draws inspiration from the Shrink-On-No-Overlaps (SONO) (Pieranski 1998 In Ideal knots (eds A Stasiak, V Katritch, LH Kauffman), vol. 19, pp. 20–41.) algorithm for the tightening of knots and links: we call it Periodic-Branched Shrink-On-No-Overlaps (PB-SONO). We reproduce published results for ideal configurations of knots using PB-SONO. We then examine ideal geometry for finite entangled graphs, including θ -graphs and entangled tetrahedron- and cube-graphs. Finally, we compute ideal conformations of periodic weavings and entangled nets. The resulting ideal geometry is intriguing: we see spontaneous symmetrisation in some cases, breaking of symmetry in others, as well as configurations reminiscent of biological and chemical structures in nature.

A general multistage procedure fork-out-of-ngatekeeping

We generalize a multistage procedure for parallel gatekeeping to what we refer to as k-out-of-n gatekeeping in which at least k out of n hypotheses ( 1 ⩽ k ⩽ n) in a gatekeeper family must be rejected in order to test the hypotheses in the following family. This gatekeeping restriction arises in certain types of clinical trials; for example, in rheumatoid arthritis trials, it is required that efficacy be shown on at least three of the four primary endpoints. We provide a unified theory of multistage procedures for arbitrary k, with k = 1 corresponding to parallel gatekeeping and k = n to serial gatekeeping. The theory provides an insight into the construction of truncated separable multistage procedures using the closure method. Explicit formulae for calculating the adjusted p-values are given. The proposed procedure is simpler to apply for this particular problem using a stepwise algorithm than the mixture procedure and the graphical procedure with memory using entangled graphs.

Multipartite entanglement and hypergraph states of three qubits

Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into six classes and only one of them is not equivalent to any graph state; (ii) under stochastic local operations with classical communication, for the single-copy case hypergraph states of three qubits, partitioned into five classes which cannot be converted into a $W$ state, are equivalent to graph states; and (iii) when bipartite entanglement in three qubits is considered, hypergraph states of three qubits are split into five classes and only one of them has the same entangled graph as the $W$ state.

Memory and other properties of multiple test procedures generated by entangled graphs

Methods for addressing multiplicity in clinical trials have attracted much attention during the past 20 years. They include the investigation of new classes of multiple test procedures, such as fixed sequence, fallback and gatekeeping procedures. More recently, sequentially rejective graphical test procedures have been introduced to construct and visualize complex multiple test strategies. These methods propagate the local significance level of a rejected null hypothesis to not-yet rejected hypotheses. In the graph defining the test procedure, hypotheses together with their local significance levels are represented by weighted vertices and the propagation rule by weighted directed edges. An algorithm provides the rules for updating the local significance levels and the transition weights after rejecting an individual hypothesis. These graphical procedures have no memory in the sense that the origin of the propagated significance level is ignored in subsequent iterations. However, in some clinical trial applications, memory is desirable to reflect the underlying dependence structure of the study objectives. In such cases, it would allow the further propagation of significance levels to be dependent on their origin and thus reflect the grouped parent-descendant structures of the hypotheses. We will give examples of such situations and show how to induce memory and other properties by convex combination of several individual graphs. The resulting entangled graphs provide an intuitive way to represent the underlying relative importance relationships between the hypotheses, are as easy to perform as the original individual graphs, remain sequentially rejective and control the familywise error rate in the strong sense.

Generation of Multi-qubit Graph States via Spin Networks

We propose an efficient scheme for preparing multi-qubit graph states via spin networks. The classical types of graph states including cluster state, Greenberger-Horne-Zeilinger state and circle-shaped states can be generated by using imaginary SWAP gate. Our method makes the generation of multipartite entangled graph states more efficient than the ones based on conventional controlled-NOT and controlled phase flip gate for solid-state devices.

Generation of various multiatom entangled graph states via resonant interactions

In this paper, a scheme for generating various multiatom entangled graph states via resonant interactions is proposed. We investigate the generation of various four-atom graph states first in the ideal case and then in the case in which the cavity decay and atomic spontaneous emission are taken into consideration in the process of interaction. More importantly, we improve the possible distortion of the graph states coming from cavity decay and atomic spontaneous emission by performing appropriate unitary transforms on atoms. The generation of multiatom entangled graph states is very important for constructing quantum one-way computer in a fault-tolerant manner. The resonant interaction time is very short, which is important in the sense of decoherence. Our scheme is easy and feasible within the reach of current experimental technology.

Three-qubit interpretation of BPS and non-BPSSTUblack holes

Following the recent trend we develop further the black hole analogy between quantum information theory and the theory of extremal stringy black hole solutions. We show that the three-qubit interpretation of supersymmetric black hole solutions in the $STU$ model can be extended also to include nonsupersymmetric ones. First we show that the black hole potential can be expressed as one half the norm of a suitably chosen three-qubit entangled state containing the quantized charges and the moduli. The extremization of the black hole potential in terms of this entangled state amounts to either suppressing bit flip errors (BPS case) or allowing very special types of flips transforming the states between different classes of non-BPS solutions. We are illustrating our results for the example of the $D2\char21{}D6$ system. In this case the bit flip errors are corresponding to sign flip errors of the charges originating from the number of $D2$ branes. After moduli stabilization the states depending entirely on the charges are maximally entangled graph states (of the triangle graph) well known from quantum information theory. An $N=8$ interpretation of the $STU$ model in terms of a mixed state with fermionic purifications is also given.

Generalized flow and determinism in measurement-based quantum computation

We extend the notion of quantum information flow defined by Danos and Kashefi (2006 Phys. Rev. A 74 052310) for the one-way model (Raussendorf and Briegel 2001 Phys. Rev. Lett. 86 910) and present a necessary and sufficient condition for the stepwise uniformly deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the (X, Y), (X, Z) and (Y, Z) planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the stepwise uniformly deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly valuable for the study of the algorithms and complexity in the one-way model.