Topological Characterization with a Twist, Condensation, and Reflection

• URL: http://arxiv.org/abs/2209.11126v1
• Date: Thu, 22 Sep 2022 16:11:51 GMT
• Title: Topological Characterization with a Twist, Condensation, and Reflection
• Authors: Tushar Pandey, Eugene Dumitrescu
• Abstract summary: We provide a series of experimentally accessible near- and medium-term protocols assessing the fidelity of logical processes. We then present a $mathbbZ_4$ topological quasiparticle reflectometry and scattering protocol. Our logical and scattering protocols are suitable for near-term devices where many physical qubits encode few logical qubits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Despite its putative robustness, the realization of and control over topological quantum matter is an ongoing grand challenge. Looking forward, robust characterization protocols are needed to first certify topological substrates before they are utilized in quantum algorithms. We contribute to this grand challenge by providing a series of experimentally accessible near- and medium-term protocols assessing the fidelity of logical processes. To do so we examine logical operators and anyonic quasiparticle excitations in twisted $\mathbb{Z}_{N=2,4}$ gauge theories. Extending the finite twist, a promising route to Ising computing in its own right, to a non-contractible twist fuses prior logical operators together and results in a twisted qubit code. The code is notable for a doubled and tripled code distance for logical $Y$ and $X$ errors respectively. Next, we review the deconfinement properties of a $\mathbb{Z}_4$ double semion condensation and provide an error correction algorithm. Based on this understanding we then present a $\mathbb{Z}_4$ topological quasiparticle reflectometry and scattering protocol. The protocol infers the topological properties of the system and serves as a high-level metric for the performance and lifetime of the interfaced topological codes. Our logical and scattering protocols are suitable for near-term devices where many physical qubits encode few logical qubits. The topological lifetime of a particle within a condensate conjugacy class, previously considered in fabricated and hetero-structured condensed-matter experiments, serves as a unifying performance metric across synthetic, qubit-based, and naturally occurring topological order.

Related papers

• Protocols for Creating Anyons and Defects via Gauging [0.0]
  We provide a physical protocol for implementing the ribbon operators of non-Abelian anyons and symmetry defects. We showcase this for anyons and defects in the $mathbbZ_3$ toric code and $S_3$ quantum double.
  arXiv  Detail & Related papers  (2024-11-06T19:00:01Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• K-sparse Pure State Tomography with Phase Estimation [1.2183405753834557]
  Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits. QST reconstruction for any pure state composed of the superposition of $K$ different computational basis states of $n$bits in a specific measurement set-up is presented.
  arXiv  Detail & Related papers  (2021-11-08T09:43:12Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• $\mathbb{Z}_2$ lattice gauge theories and Kitaev's toric code: A scheme for analog quantum simulation [0.0]
  Kitaev's toric code is an exactly solvable model with $mathbbZ$-topological order. Our work paves the way for realizing non-Abelian anyons in analog quantum simulators.
  arXiv  Detail & Related papers  (2020-12-09T18:59:58Z)
• Prediction of Toric Code Topological Order from Rydberg Blockade [0.0]
  We find a topological quantum liquid (TQL) as evidenced by multiple measures. We show how these can be measured experimentally using a dynamic protocol. We discuss the implications for exploring fault-tolerant quantum memories.
  arXiv  Detail & Related papers  (2020-11-24T19:00:05Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Geometry of quantum complexity [0.0]
  Computational complexity is a new quantum information concept that may play an important role in holography. We consider quantum computational complexity for $n$ qubits using Nielsen's geometrical approach.
  arXiv  Detail & Related papers  (2020-11-15T18:41:19Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.