Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTopological contextuality and anyonic statistics of photonic-encoded parafermions
129
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quasiparticle poisoning, expected to arise during the measurement of Majorana zero mode state, poses a fundamental problem towards the realization of Majorana-based quantum computation. Parafermions, a natural generalization of Majorana fermions, can encode topological qudits immune to quasiparticle poisoning. While parafermions are expected to emerge in superconducting fractional quantum Hall systems, they are not yet attainable with current technology. To bypass this problem, we employ a photonic quantum simulator to experimentally demonstrate the key components of parafermion-based universal quantum computation. Our contributions in this article are twofold. First, by manipulating the photonic states, we realize Clifford operator Berry phases that correspond to braiding statistics of parafermions. Second, we investigate the quantum contextuality in a topological system for the first time by demonstrating the contextuality of parafermion encoded qudit states. Importantly, we find that the topologically-encoded contextuality opens the way to magic state distillation, while both the contextuality and the braiding-induced Clifford gates are resilient against local noise. By introducing contextuality, our photonic quantum simulation provides the first step towards a physically robust methodology for realizing topological quantum computation.
rate research
Read More
Bipartite entanglement entropies, calculated from the reduced density matrix of a subsystem, provide a description of the resources available within a system for performing quantum information processing. However, these quantities are not uniquely defined on a system of non-Abelian anyons. This paper describes how reduced density matrices and bipartite entanglement entropies (such as the von Neumann and Renyi entropies) may be constructed for non-Abelian anyonic systems, in ways which reduce to the conventional definitions for systems with only local degrees of freedom.
Anyons, particles displaying a fractional exchange statistics intermediate between bosons and fermions, play a central role in the fractional quantum Hall effect and various spin lattice models, and have been proposed for topological quantum computing schemes due to their resilience to noise. Here we use parametric down-conversion in an integrated semiconductor chip to generate biphoton states simulating anyonic particle statistics, in a reconfigurable manner. Our scheme exploits the frequency entanglement of the photon pairs, which is directly controlled through the spatial shaping of the pump beam. These results, demonstrated at room temperature and telecom wavelength on a chip-integrated platform, pave the way to the practical implementation of quantum simulation tasks with tailored particle statistics.
$mathbb{Z}_d$ Parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows to perform an entangling gate. This has spurred interest in parafermions and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a familiy of $2d$ representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a $d$-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows to generate the entire single-qudit Clifford group (up to phases), for any $d$. If $d$ is odd, then we show that in fact the entire many-qudit Clifford group can be generated.
We describe a continuous-variable scheme for simulating the Kitaev lattice model and for detecting statistics of abelian anyons. The corresponding quantum optical implementation is solely based upon Gaussian resource states and Gaussian operations, hence allowing for a highly efficient creation, manipulation, and detection of anyons. This approach extends our understanding of the control and application of anyons and it leads to the possibility for experimental proof-of-principle demonstrations of anyonic statistics using continuous-variable systems.
In this work we introduce two code families, which we call the heavy hexagon code and heavy square code. Both code families are implemented by assigning physical data and ancilla qubits to both vertices and edges of low degree graphs. Such a layout is particularly suitable for superconducting qubit architectures to minimize frequency collisions and crosstalk. In some cases, frequency collisions can be reduced by several orders of magnitude. The heavy hexagon code is a hybrid surface/Bacon-Shor code mapped onto a (heavy) hexagonal lattice whereas the heavy square code is the surface code mapped onto a (heavy) square lattice. In both cases, the lattice includes all the ancilla qubits required for fault-tolerant error-correction. Naively, the limited qubit connectivity might be thought to limit the error-correcting capability of the code to less than its full distance. Therefore, essential to our construction is the use of flag qubits. We modify minimum weight perfect matching decoding to efficiently and scalably incorporate information from measurements of the flag qubits and correct up to the full code distance while respecting the limited connectivity. Simulations show that high threshold values for both codes can be obtained using our decoding protocol. Further, our decoding scheme can be adapted to other topological code families.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
