Unveiling the Non-Abelian Statistics of D(S_{3}) Anyons Using a Classical Photonic Simulator

Simulators can realize novel phenomena by separating them from the complexities of a full physical implementation. Here, we put forward a scheme that can simulate the exotic statistics of D(S_{3}) non-Abelian anyons with minimal resources. The qudit lattice representation of this planar code supports local encoding of D(S_{3}) anyons. As a proof-of-principle demonstration, we employ a classical photonic simulator to encode a single qutrit and manipulate it to perform the fusion and braiding properties of non-Abelian D(S_{3}) anyons. The photonic technology allows us to perform the required nonunitary operations with much higher fidelity than what can be achieved with current quantum computers. Our approach can be directly generalized to larger systems or to different anyonic models, thus enabling advances in the exploration of quantum error correction and fundamental physics alike.

Adjustable rotation of multiple vortices produced by diode-pumped Nd:YVO4 lasers using intracavity second harmonic generation

The criteria for achieving adjustable rotation of optical vortices are analyzed and used to design a diode-pumped solid-state laser that incorporates intracavity second harmonic generation within a concave-flat cavity to produce frequency-doubled Hermite-Gaussian (FDHG) modes. These FDHG modes are subsequently employed to generate various structured lights containing 2, 4, and 6 nested vortices using an external cylindrical mode converter. Through theoretical exploration, we propose that increasing the radius of curvature of the concave mirror and extending the cavity length can enhance the rotational angles of multiple vortices by expanding the adjustable range of phase shift for FDHG modes. Moreover, theoretical analyses assess vortex rotation concerning the positions of a nonlinear medium, successfully validating the experimental observations and elucidating the phase structures of the transformed beams.

Suppressing Decoherence in Quantum State Transfer with Unitary Operations

Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In this work, by following the recent theoretical proposal, we study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state against the effect of decoherence acting on all qubits. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment, where all protecting unitaries are perfect, and in a real experiment with a cloud-accessible quantum processor, where protecting unitaries themselves are affected by the noise. We expect the considered approach to be useful for analyzing capabilities of quantum information processing devices in transmitting known quantum states. We also demonstrate the applicability of the developed approach for suppressing decoherence in the process of distributing a two-qubit state over remote physical qubits of a quantum processor.

Erasure Tolerant Quantum Memory and the Quantum Null Energy Condition in Holographic Systems

Investigating principles for storage of quantum information at finite temperature with minimal need for active error correction is an active area of research. We bear upon this question in two-dimensional holographic conformal field theories via the quantum null energy condition that we have shown earlier to implement the restrictions imposed by quantum thermodynamics on such many-body systems. We study an explicit encoding of a logical qubit into two similar chirally propagating excitations of finite von Neumann entropy on a finite temperature background whose erasure can be implemented by an appropriate inhomogeneous and instantaneous energy-momentum inflow from an infinite energy memoryless bath due to which the system transits to a thermal state. Holographically, these fast erasure processes can be depicted by generalized AdS-Vaidya geometries described previously in which no assumption of specific form of bulk matter is needed. We show that the quantum null energy condition gives analytic results for the minimal finite temperature needed for the deletion which is larger than the initial background temperature in consistency with Landauer's principle. In particular, we find a simple expression for the minimum final temperature needed for the erasure of a large number of encoding qubits. We also find that if the encoding qubits are localized over an interval shorter than a specific localization length, then the fast erasure process is impossible, and furthermore this localization length is the largest for an optimal amount of encoding qubits determined by the central charge. We estimate the optimal encoding qubits for realistic protection against fast erasure. We discuss possible generalizations of our study for novel constructions of fault-tolerant quantum gates operating at finite temperature.

Demonstration of Topological Robustness of Anyonic Braiding Statistics with a Superconducting Quantum Circuit

Anyons are quasiparticles occurring in two dimensions, whose topological properties are believed to be robust against local perturbations and may hold promise for fault tolerant quantum computing. Here we present an experiment of demonstrating the path independent nature of anyonic braiding statistics with a superconducting quantum circuit, which represents a 7-qubit version of the toric code model. We dynamically create the ground state of the model, achieving a state fidelity of 0.688±0.015 as verified by quantum state tomography. Anyonic excitations and braiding operations are subsequently implemented with single-qubit rotations. The braiding robustness is witnessed by looping an anyonic excitation around another one along two distinct, but topologically equivalent paths: Both reveal the nontrivial π-phase shift, the hallmark of Abelian 1/2 anyons, with a phase accuracy of ∼99% in the Ramsey-type interference measurement.

High threshold error correction for the surface code

An algorithm is presented for error correction in the surface code quantum memory. This is shown to correct depolarizing noise up to a threshold error rate of 18.5%, exceeding previous results and coming close to the upper bound of 18.9%. The time complexity of the algorithm is found to be polynomial with error suppression, allowing efficient error correction for codes of realistic sizes.

Topological quantum hashing with the icosahedral group

We study an efficient algorithm to hash any single-qubit gate into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different lengths, we introduce a series of pseudogroups. Joining these braid segments in a renormalization group fashion, we obtain a Gaussian unitary ensemble of random-matrix representations of braids. With braids of length O(log2(1/epsilon)), we can approximate all SU(2) matrices to an average error epsilon with a cost of O(log(1/epsilon)) in time. The algorithm is applicable to generic quantum compiling.