CoChat

Non-Abelian braiding of graph vertices in a superconducting processor

Open access
Google Quantum AI and Collaborators, Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., Acharya, R., Allen, R., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Bacon, D., Bardin, J. C., Bortoli, G., Bourassa, A., Bovaird, J., Brill, L., Broughton, M., Buckley, B. B., Buell, D. A., Burger, T., Burkett, B., Bushnell, N., Chen, Z., Chiaro, B., Chik, D., Chou, C., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Debroy, D. M., Del Toro Barba, A., Demura, S., Dunsworth, A., Eppens, D., Erickson, C., Faoro, L., Farhi, E., Fatemi, R., Ferreira, V. S., Burgos, L. F., Forati, E., Fowler, A. G., Foxen, B., Giang, W., Gidney, C., Gilboa, D., Giustina, M., Gosula, R., Dau, A. G., Gross, J. A., Habegger, S., Hamilton, M. C., Hansen, M., Harrigan, M. P., Harrington, S. D., Heu, P., Hilton, J., Hoffmann, M. R., Huang, T., Huff, A., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Iveland, J., Jeffrey, E., Jiang, Z., Jones, C., Juhas, P., Kafri, D., Khattar, T., Khezri, M., Kieferová, M., Kim, S., Kitaev, A., Klimov, P. V., Klots, A. R., Korotkov, A. N., Kostritsa, F., Kreikebaum, J. M., Landhuis, D., Laptev, P., Lau, K.-M., Laws, L., Lee, J., Lee, K. W., Lester, B. J., Lill, A. T., Liu, W., Locharla, A., Lucero, E., Malone, F. D., Martin, O., McClean, J. R., McCourt, T., McEwen, M., Miao, K. C., Mieszala, A., Mohseni, M., Montazeri, S., Mount, E., Movassagh, R., Mruczkiewicz, W., Naaman, O., Neeley, M., Neill, C., Nersisyan, A., Newman, M., Ng, J. H., Nguyen, A., Nguyen, M., Niu, M. Y., O’Brien, T. E., Omonije, S., Petukhov, A., Potter, R., Pryadko, L. P., Quintana, C., Rocque, C., Rubin, N. C., Saei, N., Sank, D., Sankaragomathi, K., Satzinger, K. J., Schurkus, H. F., Schuster, C., Shearn, M. J., Shorter, A., Shutty, N., Shvarts, V., Skruzny, J., Smith, W. C., Somma, R., Sterling, G., Strain, D., Szalay, M., Torres, A., Vidal, G., Villalonga, B., Heidweiller, C. V., White, T., Woo, B. W. K., Xing, C., Yao, Z. J., Yeh, P., Yoo, J., Young, G., Zalcman, A., Zhang, Y., Zhu, N., Zobrist, N., Neven, H., Boixo, S., Megrant, A., Kelly, J., Chen, Y., Smelyanskiy, V., Kim, E.-A., Aleiner, I., Roushan, P. · 2023 · Nature

The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.

Abstract

Indistinguishability of particles is a fundamental principle of quantum mechanics 1 . For all elementary and quasiparticles observed to date—including fermions, bosons and Abelian anyons—this principle guarantees that the braiding of identical particles leaves the system unchanged 2,3 . However, in two spatial dimensions, an intriguing possibility exists: braiding of non-Abelian anyons causes rotations in a space of topologically degenerate wavefunctions 4–8 . Hence, it can change the observables of the system without violating the principle of indistinguishability. Despite the well-developed mathematical description of non-Abelian anyons and numerous theoretical proposals 9–22 , the experimental observation of their exchange statistics has remained elusive for decades. Controllable many-body quantum states generated on quantum processors offer another path for exploring these fundamental phenomena. Whereas efforts on conventional solid-state platforms typically involve Hamiltonian dynamics of quasiparticles, superconducting quantum processors allow for directly manipulating the many-body wavefunction by means of unitary gates. Building on predictions that stabilizer codes can host projective non-Abelian Ising anyons 9,10 , we implement a generalized stabilizer code and unitary protocol 23 to create and braid them. This allows us to experimentally verify the fusion rules of the anyons and braid them to realize their statistics. We then study the prospect of using the anyons for quantum computation and use braiding to create an entangled state of anyons encoding three logical qubits. Our work provides new insights about non-Abelian braiding and, through the future inclusion of error correction to achieve topological protection, could open a path towards fault-tolerant quantum computing.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41586-023-05954-4

Cites

46 of 46 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Deformations of the surface code. a, Stabilizer codes are conveniently described in a graph framework. Through deformations of the surface code graph, a square grid of qubits (crosses) can be used to realize more generalized graphs. Plaquette violations (red) correspond to stabilizers with sp = −1 and are created by local Pauli operations. In the absence of deformations, plaquette violations are constrained to move on one of the two sublattices of the dual graph in the surface code, hence the two shades of blue. b, A pair of D3Vs (yellow triangles) appears by removing an edge between two neighbouring stabilizers, Sˆ1 and Sˆ2, and introducing the new stabilizer, Sˆ=Sˆ1Sˆ2. A D3V is moved by applying a two-qubit entangling gate, exp(π/8[Sˆ^(′),Sˆ]). In the presence of bulk D3Vs, there is no consistent way of chequerboard colouring, hence the (arbitrarily chosen) grey regions. The top right shows that in a general stabilizer graph, Sˆp can be found from a constraint at each vertex, where {τ1, τ2} = 0.
Fig. 1 Deformations of the surface code. a, Stabilizer codes are conveniently described in a graph framework. Through deformations of the surface code graph, a square grid of qubits (crosses) can be used to realize more generalized graphs. Plaquette violations (red) correspond to stabilizers with sp = −1 and are created by local Pauli operations. In the absence of deformations, plaquette violations are constrained to move on one of the two sublattices of the dual graph in the surface code, hence the two shades of blue. b, A pair of D3Vs (yellow triangles) appears by removing an edge between two neighbouring stabilizers, Sˆ1 and Sˆ2, and introducing the new stabilizer, Sˆ=Sˆ1Sˆ2. A D3V is moved by applying a two-qubit entangling gate, exp(π/8[Sˆ^(′),Sˆ]). In the presence of bulk D3Vs, there is no consistent way of chequerboard colouring, hence the (arbitrarily chosen) grey regions. The top right shows that in a general stabilizer graph, Sˆp can be found from a constraint at each vertex, where {τ1, τ2} = 0.CC BY · PubMed Central
Fig. 2 Demonstration of the fundamental fusion rules of D3Vs. a, The braiding worldlines used to fuse ε and σ. b, Expectation values of stabilizers at each step of the unitary operation after readout correction (see Extended Data Fig. 3 for details and individual stabilizer values). We first prepare the ground state of the surface code (step (i); average stabilizer value of 0.94 ± 0.04, where the uncertainty is one standard deviation). A D3V (σ) pair is then created (ii) and separated (iii)–(iv), before creating a fermion, ε (v). One of the plaquette violations is brought around the right σ (vi)–(viii), allowing it to annihilate with the other plaquette violation (viii). The fermion has seemingly disappeared, but re-emerges when the σ are annihilated ((xi); stabilizer values −0.86 and −0.87). The path (v) → (viii) demonstrates the fusion rule, σ × ε = σ. The different fermion parities at the end of the paths (viii) → (xi) and (iv) → (i) show the other fusion rule, σ×σ=1+ε. Yellow triangles represent the positions of the σ. The brown and red lines denote the paths of the σ and the plaquette violation, respectively. Red squares (diamonds) represent X (Z) gates. Upper left shows a table of two-qubit unitaries used in the protocol. Each stabilizer was measured n = 10,000 times in each step. c, A non-local technique for hidden fermion detection: the presence of a fermion in a σ-pair can be deduced by measuring the sign of the Pauli string Pˆ corresponding to bringing a plaquette violation around the σ-pair (grey path). Pˆ is equivalent to the shorter string P^(′)ˆ (black path). Measurements of P^(′)ˆ in steps (viii) (top) and (iv) (bottom) give values of −0.85 ± 0.01 and +0.84 ± 0.01, respectively. This indicates that there is a hidden fermion pair in the former case, but not in the latter, despite the stabilizers being the same.
Fig. 2 Demonstration of the fundamental fusion rules of D3Vs. a, The braiding worldlines used to fuse ε and σ. b, Expectation values of stabilizers at each step of the unitary operation after readout correction (see Extended Data Fig. 3 for details and individual stabilizer values). We first prepare the ground state of the surface code (step (i); average stabilizer value of 0.94 ± 0.04, where the uncertainty is one standard deviation). A D3V (σ) pair is then created (ii) and separated (iii)–(iv), before creating a fermion, ε (v). One of the plaquette violations is brought around the right σ (vi)–(viii), allowing it to annihilate with the other plaquette violation (viii). The fermion has seemingly disappeared, but re-emerges when the σ are annihilated ((xi); stabilizer values −0.86 and −0.87). The path (v) → (viii) demonstrates the fusion rule, σ × ε = σ. The different fermion parities at the end of the paths (viii) → (xi) and (iv) → (i) show the other fusion rule, σ×σ=1+ε. Yellow triangles represent the positions of the σ. The brown and red lines denote the paths of the σ and the plaquette violation, respectively. Red squares (diamonds) represent X (Z) gates. Upper left shows a table of two-qubit unitaries used in the protocol. Each stabilizer was measured n = 10,000 times in each step. c, A non-local technique for hidden fermion detection: the presence of a fermion in a σ-pair can be deduced by measuring the sign of the Pauli string Pˆ corresponding to bringing a plaquette violation around the σ-pair (grey path). Pˆ is equivalent to the shorter string P^(′)ˆ (black path). Measurements of P^(′)ˆ in steps (viii) (top) and (iv) (bottom) give values of −0.85 ± 0.01 and +0.84 ± 0.01, respectively. This indicates that there is a hidden fermion pair in the former case, but not in the latter, despite the stabilizers being the same.CC BY · PubMed Central
Fig. 3 Braiding of non-Abelian anyons. a, Wordline schematic of the braiding process. b, Experimental demonstration of braiding, showing the values of the stabilizers throughout the process. Two σ pairs, A and B, are created from the vacuum 1, and one of the σ in pair A is brought to the right side of the grid. Next, a σ from pair B is moved to the top, thus crossing the path of pair A, before bringing σ pairs A and B back together to complete the braid. In the final step, two fermions appear in the locations where the σ pairs resided, constituting a change in the local observables. The diagonal σ move in step (iv) requires two SWAP gates (three CZ gates each) and a total of ten CZ gates. The three-qubit unitary in step (viii) requires four SWAP gates and a total of 15 CZ gates. In the full circuit, a total of 40 layers of CZ gates are applied (Methods). The yellow triangles represent the locations of the σ; the brown and green lines represent the paths of σ from pairs A and B, respectively. The four red stabilizers in (xii) have a mean value of −0.45 ± 0.06, where the uncertainty is one standard deviation. Each stabilizer was measured n = 10,000 times in each step. c, As a control experiment, we perform the same braid as in a, but with distinguishable σ by attaching a plaquette violation to the σ in pair B (represented with purple triangles). d, Same as b, but using distinguishable σ (only showing steps (i), (iv) and (xii)). In contrast to b, no fermions are observed in step (xii).
Fig. 3 Braiding of non-Abelian anyons. a, Wordline schematic of the braiding process. b, Experimental demonstration of braiding, showing the values of the stabilizers throughout the process. Two σ pairs, A and B, are created from the vacuum 1, and one of the σ in pair A is brought to the right side of the grid. Next, a σ from pair B is moved to the top, thus crossing the path of pair A, before bringing σ pairs A and B back together to complete the braid. In the final step, two fermions appear in the locations where the σ pairs resided, constituting a change in the local observables. The diagonal σ move in step (iv) requires two SWAP gates (three CZ gates each) and a total of ten CZ gates. The three-qubit unitary in step (viii) requires four SWAP gates and a total of 15 CZ gates. In the full circuit, a total of 40 layers of CZ gates are applied (Methods). The yellow triangles represent the locations of the σ; the brown and green lines represent the paths of σ from pairs A and B, respectively. The four red stabilizers in (xii) have a mean value of −0.45 ± 0.06, where the uncertainty is one standard deviation. Each stabilizer was measured n = 10,000 times in each step. c, As a control experiment, we perform the same braid as in a, but with distinguishable σ by attaching a plaquette violation to the σ in pair B (represented with purple triangles). d, Same as b, but using distinguishable σ (only showing steps (i), (iv) and (xii)). In contrast to b, no fermions are observed in step (xii).CC BY · PubMed Central
Fig. 4 Entangled state of anyon-encoded logical qubits by means of braiding. a, Logical operators of the three logical qubits encoded in the eight anyons (other basis choices are possible). The coloured curves in the left column denote plaquette violation paths, before reduction to shorter, equivalent Pauli strings measured in the experiment (right column). b, Worldline schematic of the single exchange used to realize an entangled state of the logical qubits. c, Single exchange of the non-Abelian anyons, showing measurements of the stabilizers throughout the protocol. Yellow triangles represent the locations of the σ, whereas brown and green lines denote their paths. The average stabilizer values are 0.95 ± 0.04 and 0.88 ± 0.05 (one standard deviation) in the first and last step, respectively. Each stabilizer was measured n = 20,000 times in each step. d,e, Real (d) and imaginary (e) parts of the reconstructed density matrix from the quantum state tomography. Re(ρ) has clear peaks in its corners, as expected for a GHZ state on the form (∣000⟩+∣111⟩)/√2. The overlap with the ideal GHZ state is Tr{ρGHZρ}=0.623±0.004, where the uncertainty is one standard deviation determined from bootstrapping.
Fig. 4 Entangled state of anyon-encoded logical qubits by means of braiding. a, Logical operators of the three logical qubits encoded in the eight anyons (other basis choices are possible). The coloured curves in the left column denote plaquette violation paths, before reduction to shorter, equivalent Pauli strings measured in the experiment (right column). b, Worldline schematic of the single exchange used to realize an entangled state of the logical qubits. c, Single exchange of the non-Abelian anyons, showing measurements of the stabilizers throughout the protocol. Yellow triangles represent the locations of the σ, whereas brown and green lines denote their paths. The average stabilizer values are 0.95 ± 0.04 and 0.88 ± 0.05 (one standard deviation) in the first and last step, respectively. Each stabilizer was measured n = 20,000 times in each step. d,e, Real (d) and imaginary (e) parts of the reconstructed density matrix from the quantum state tomography. Re(ρ) has clear peaks in its corners, as expected for a GHZ state on the form (∣000⟩+∣111⟩)/√2. The overlap with the ideal GHZ state is Tr{ρGHZρ}=0.623±0.004, where the uncertainty is one standard deviation determined from bootstrapping.CC BY · PubMed Central
Extended Data Fig. 1 Qubit relaxation (T1) and coherence (T2) times. a,b, Cummulative distributions of T1 (a) and T2 (b), where the latter is measured using a Hahn echo sequence. Dashed lines indicate the median values of 21.7 μs for both measures. Insets: T1 and T2 plotted against qubit number.
Extended Data Fig. 1 Qubit relaxation (T1) and coherence (T2) times. a,b, Cummulative distributions of T1 (a) and T2 (b), where the latter is measured using a Hahn echo sequence. Dashed lines indicate the median values of 21.7 μs for both measures. Insets: T1 and T2 plotted against qubit number.CC BY · PubMed Central
Extended Data Fig. 2 Gate errors. a,b, Cummulative distributions of the Pauli error for single-qubit (a) and two-qubit CZ (b) gates. We find median error values of 1.3 × 10−3 and 7.3 × 10−3 for the single-qubit and CZ gates, respectively.
Extended Data Fig. 2 Gate errors. a,b, Cummulative distributions of the Pauli error for single-qubit (a) and two-qubit CZ (b) gates. We find median error values of 1.3 × 10−3 and 7.3 × 10−3 for the single-qubit and CZ gates, respectively.CC BY · PubMed Central
Extended Data Fig. 3 Readout benchmarking and correction. a, Histogram of readout error, with a median value of 2.0% (dashed vertical line). Inset: readout error plotted against qubit number. b,c, Stabilizer values of the surface code ground state before (b) and after (c) readout correction.
Extended Data Fig. 3 Readout benchmarking and correction. a, Histogram of readout error, with a median value of 2.0% (dashed vertical line). Inset: readout error plotted against qubit number. b,c, Stabilizer values of the surface code ground state before (b) and after (c) readout correction.CC BY · PubMed Central
Extended Data Fig. 4 Dynamical decoupling. a,b, Stabilizer values without (a) and with (b) dynamical decoupling, after D3V braiding. Dynamical decoupling improves the average absolute stabilizer value from 0.50 to 0.58.
Extended Data Fig. 4 Dynamical decoupling. a,b, Stabilizer values without (a) and with (b) dynamical decoupling, after D3V braiding. Dynamical decoupling improves the average absolute stabilizer value from 0.50 to 0.58.CC BY · PubMed Central
Extended Data Fig. 5 Circuit details. Circuits used for the fusion experiment (a), the full-braid experiment (b), and the half-braid experiment (c), shown in Figs. 2–4, respectively, in the main text. Turqoise and gray boxes denote dynamical decoupling and phased XZ-gates, respectively. In the full-braid experiment (b), we include five single-qubit rotations to permute Xˆ, Yˆ and Zˆ of the three stabilizers touching the moving D3V in steps V-VIII and IX-XI, as well as three Hadamard-gates to return all stabilizers to the original ZˆXˆXˆZˆ-form in XII. See Extended Data Fig. 6 for the circuit used for ground state preparation, as well as details on how the multi-qubit unitary gates used to move anyons are decomposed into CZ-gates.
Extended Data Fig. 5 Circuit details. Circuits used for the fusion experiment (a), the full-braid experiment (b), and the half-braid experiment (c), shown in Figs. 2–4, respectively, in the main text. Turqoise and gray boxes denote dynamical decoupling and phased XZ-gates, respectively. In the full-braid experiment (b), we include five single-qubit rotations to permute Xˆ, Yˆ and Zˆ of the three stabilizers touching the moving D3V in steps V-VIII and IX-XI, as well as three Hadamard-gates to return all stabilizers to the original ZˆXˆXˆZˆ-form in XII. See Extended Data Fig. 6 for the circuit used for ground state preparation, as well as details on how the multi-qubit unitary gates used to move anyons are decomposed into CZ-gates.CC BY · PubMed Central
Extended Data Fig. 6 Ground state preparation and CZ-decompositions. a, Schematic showing the circuit used for preparation of the ground state of the surface code. The protocol is the same as that shown in ref. 43, except with the inclusion of Hadamard gates on alternating qubits in the final step, since we use symmetrized stabilizers on the form ZˆXˆXˆZˆ. b, The unitary needed to move a D3V between two neighboring vertices is realized in the experiment through the use of one CZ-gate and single-qubit rotations. c, When D3Vs are moved diagonally, we include two SWAP gates, requiring three CZ-gates each. d, Main: the three-qubit unitary used in step VIII in Fig. 3 is equivalent to a combination of single-qubit gates, 4 SWAP-gates and 4 CZ-gates. Right dashed box: decomposition of a SWAP-gate into CZ-gates. e, Adjacent single-qubit gates are merged and shifted left to the nearest CZ-gate.
Extended Data Fig. 6 Ground state preparation and CZ-decompositions. a, Schematic showing the circuit used for preparation of the ground state of the surface code. The protocol is the same as that shown in ref. 43, except with the inclusion of Hadamard gates on alternating qubits in the final step, since we use symmetrized stabilizers on the form ZˆXˆXˆZˆ. b, The unitary needed to move a D3V between two neighboring vertices is realized in the experiment through the use of one CZ-gate and single-qubit rotations. c, When D3Vs are moved diagonally, we include two SWAP gates, requiring three CZ-gates each. d, Main: the three-qubit unitary used in step VIII in Fig. 3 is equivalent to a combination of single-qubit gates, 4 SWAP-gates and 4 CZ-gates. Right dashed box: decomposition of a SWAP-gate into CZ-gates. e, Adjacent single-qubit gates are merged and shifted left to the nearest CZ-gate.CC BY · PubMed Central
Extended Data Fig. 7 Simulation of braiding in the presence of noise. a, Simulation results. b, Experimental data (same as in step XII in Fig. 3b). We observe relatively good agreement between the simulation and the experimental results, except some discrepancies that are attributed to inhomogeneity of the errors.
Extended Data Fig. 7 Simulation of braiding in the presence of noise. a, Simulation results. b, Experimental data (same as in step XII in Fig. 3b). We observe relatively good agreement between the simulation and the experimental results, except some discrepancies that are attributed to inhomogeneity of the errors.CC BY · PubMed Central
Extended Data Fig. 8 Braiding distinguishable D3Vs. a, Braiding schematic of worldlines. b, Step-by-step depiction of stabilizers as the two σ are braided, analogous to that in Fig. 3, but with distinguishable σ.
Extended Data Fig. 8 Braiding distinguishable D3Vs. a, Braiding schematic of worldlines. b, Step-by-step depiction of stabilizers as the two σ are braided, analogous to that in Fig. 3, but with distinguishable σ.CC BY · PubMed Central
Extended Data Fig. 9 Alternative protocol for braiding σ. a, Schematic displaying the braiding process of the two σ-pairs. b, Experimental demonstration of braiding, displaying the values of the stabilizers throughout the process. Two σ-pairs, A and B, are created from the vacuum 1, and one of the D3Vs in pair A is brought to the right side of the grid. Next, a σ from pair B is moved to the top, thus crossing the path of the first σ, before bringing the σ from pair A back again to complete the braid. The diagonal σ move performed in step VI is achieved by including two SWAP-gates, corresponding to 6 additional CZ-gates. The yellow triangles represent the locations of the σ, while the brown and green lines represent the paths of σ from pair A and B, respectively. The average absolute stabilizer value is 0.93 ± 0.06 and 0.77 ± 0.09 in the first and last step, respectively. c, After braiding the σ, we search for hidden fermions by measuring the Pauli string Pˆ (left panels), which here is equivalent to Yˆ on the qubit where the two σ overlap. The measurement yields ⟨Pˆ⟩=⟨Yˆ⟩=−0.71±0.01, indicating creation of a fermion. Right: world-lines of braiding process, including non-local measurement based on plaquette violation loop. d, Same as c, but after braiding two distinguishable σ, achieved by applying the inverse two-qubit gates when moving the σ in pair B. The measurement yields ⟨Yˆ⟩=+0.71±0.01, indicating no fermion creation.
Extended Data Fig. 9 Alternative protocol for braiding σ. a, Schematic displaying the braiding process of the two σ-pairs. b, Experimental demonstration of braiding, displaying the values of the stabilizers throughout the process. Two σ-pairs, A and B, are created from the vacuum 1, and one of the D3Vs in pair A is brought to the right side of the grid. Next, a σ from pair B is moved to the top, thus crossing the path of the first σ, before bringing the σ from pair A back again to complete the braid. The diagonal σ move performed in step VI is achieved by including two SWAP-gates, corresponding to 6 additional CZ-gates. The yellow triangles represent the locations of the σ, while the brown and green lines represent the paths of σ from pair A and B, respectively. The average absolute stabilizer value is 0.93 ± 0.06 and 0.77 ± 0.09 in the first and last step, respectively. c, After braiding the σ, we search for hidden fermions by measuring the Pauli string Pˆ (left panels), which here is equivalent to Yˆ on the qubit where the two σ overlap. The measurement yields ⟨Pˆ⟩=⟨Yˆ⟩=−0.71±0.01, indicating creation of a fermion. Right: world-lines of braiding process, including non-local measurement based on plaquette violation loop. d, Same as c, but after braiding two distinguishable σ, achieved by applying the inverse two-qubit gates when moving the σ in pair B. The measurement yields ⟨Yˆ⟩=+0.71±0.01, indicating no fermion creation.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 46 references

Research works printed but not linked: 3

  1. Sakurai, J. J. Modern Quantum Mechanics (Addison-Wesley, 1993).
  2. Barkeshli, M. & Qi, X.-L. Topological nematic states and non-Abelian lattice dislocations. Phys. Rev. X 2, 031013 (2012).
  3. Brown, B. J., Laubscher, K., Kesselring, M. S. & Wootton, J. R. Poking holes and cutting corners to achieve clifford gates with the surface code. Phys. Rev. X 7, 021029 (2017).

Cited by

See all 224

Metadata

Authors
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., Acharya, R., Allen, R., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Bacon, D., Bardin, J. C., Bortoli, G., Bourassa, A., Bovaird, J., Brill, L., Broughton, M., Buckley, B. B., Buell, D. A., Burger, T., Burkett, B., Bushnell, N., Chen, Z., Chiaro, B., Chik, D., Chou, C., Cogan, J., Collins, R., Conner, P., Courtney, W., Crook, A. L., Curtin, B., Debroy, D. M., Del Toro Barba, A., Demura, S., Dunsworth, A., Eppens, D., Erickson, C., Faoro, L., Farhi, E., Fatemi, R., Ferreira, V. S., Burgos, L. F., Forati, E., Fowler, A. G., Foxen, B., Giang, W., Gidney, C., Gilboa, D., Giustina, M., Gosula, R., Dau, A. G., Gross, J. A., Habegger, S., Hamilton, M. C., Hansen, M., Harrigan, M. P., Harrington, S. D., Heu, P., Hilton, J., Hoffmann, M. R., Huang, T., Huff, A., Huggins, W. J., Ioffe, L. B., Isakov, S. V., Iveland, J., Jeffrey, E., Jiang, Z., Jones, C., Juhas, P., Kafri, D., Khattar, T., Khezri, M., Kieferová, M., Kim, S., Kitaev, A., Klimov, P. V., Klots, A. R., Korotkov, A. N., Kostritsa, F., Kreikebaum, J. M., Landhuis, D., Laptev, P., Lau, K.-M., Laws, L., Lee, J., Lee, K. W., Lester, B. J., Lill, A. T., Liu, W., Locharla, A., Lucero, E., Malone, F. D., Martin, O., McClean, J. R., McCourt, T., McEwen, M., Miao, K. C., Mieszala, A., Mohseni, M., Montazeri, S., Mount, E., Movassagh, R., Mruczkiewicz, W., Naaman, O., Neeley, M., Neill, C., Nersisyan, A., Newman, M., Ng, J. H., Nguyen, A., Nguyen, M., Niu, M. Y., O’Brien, T. E., Omonije, S., Petukhov, A., Potter, R., Pryadko, L. P., Quintana, C., Rocque, C., Rubin, N. C., Saei, N., Sank, D., Sankaragomathi, K., Satzinger, K. J., Schurkus, H. F., Schuster, C., Shearn, M. J., Shorter, A., Shutty, N., Shvarts, V., Skruzny, J., Smith, W. C., Somma, R., Sterling, G., Strain, D., Szalay, M., Torres, A., Vidal, G., Villalonga, B., Heidweiller, C. V., White, T., Woo, B. W. K., Xing, C., Yao, Z. J., Yeh, P., Yoo, J., Young, G., Zalcman, A., Zhang, Y., Zhu, N., Zobrist, N., Neven, H., Boixo, S., Megrant, A., Kelly, J., Chen, Y., Smelyanskiy, V., Kim, E.-A., Aleiner, I., & Roushan, P.
Affiliations
  • Google (United States) (US)
  • University of Technology Sydney (AU)
  • University of California, Riverside (US)
Corresponding author
  • Kim, E.-A.
  • Roushan, P.
Venue
Nature
Published
2023-05-11
Volume
618
Issue
7964
Pages
264-269
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W4376134240
Cited by
108
References
45
Citations by year
2026: 16 · 2025: 41 · 2024: 38 · 2023: 13
FWCI
10.17
Type
journal article
Language
en
Open access
Licence
Locations
  • Nature (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • eScholarship (California Digital Library) (submittedVersion, cc-by)
Funders
  • National Science Foundation (2118310, 160761, 920665, PHY-160761)
  • Aspen Center for Physics (PHY-160761)
  • Ewha Womans University (Frontier 10-10)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
non-Abelian anyons, anyon braiding, superconducting quantum processors, Ising anyons, stabilizer codes, exchange statistics, topological quantum computation, logical qubits, entanglement, fault-tolerant quantum computing, topological protection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Non-Abelian braiding of graph vertices in a superconducting processor. https://app.cochat.ai/papers/10.1038/s41586-023-05954-4
The paper
Collaborators, G. Q. A. A., Andersen, T. I., Lensky, Y. D., Kechedzhi, K., Drozdov, I. K., Bengtsson, A., Hong, S., Morvan, A., Mi, X., Opremcak, A., Acharya, R., Allen, R., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., Babbush, R., Bacon, D., . . . Roushan, P. (2023). Non-Abelian braiding of graph vertices in a superconducting processor. Nature. https://doi.org/10.1038/s41586-023-05954-4

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.