No Arabic abstract
Anyons are exotic quasiparticles living in two dimensions that do not fit into the usual categories of fermions and bosons, but obey a new form of fractional statistics. Following a recent proposal [Phys. Rev. Lett. 98, 150404 (2007)], we present an experimental demonstration of the fractional statistics of anyons in the Kitaev spin lattice model using a photonic quantum simulator. We dynamically create the ground state and excited states (which are six-qubit graph states) of the Kitaev model Hamiltonian, and implement the anyonic braiding and fusion operations by single-qubit rotations. A phase shift of $pi$ related to the anyon braiding is observed, confirming the prediction of the fractional statistics of Abelian 1/2-anyons.
A quantum simulator is a restricted class of quantum computer that controls the interactions between quantum bits in a way that can be mapped to certain difficult quantum many-body problems. As more control is exerted over larger numbers of qubits, the simulator can tackle a wider range of problems, with the ultimate limit being a universal quantum computer that can solve general classes of hard problems. We use a quantum simulator composed of up to 53 qubits to study a non-equilibrium phase transition in the transverse field Ising model of magnetism, in a regime where conventional statistical mechanics does not apply. The qubits are represented by trapped ion spins that can be prepared in a variety of initial pure states. We apply a global long-range Ising interaction with controllable strength and range, and measure each individual qubit with near 99% efficiency. This allows the single-shot measurement of arbitrary many-body correlations for the direct probing of the dynamical phase transition and the uncovering of computationally intractable features that rely on the long-range interactions and high connectivity between the qubits.
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.
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.
Anyons are exotic quasiparticles obeying fractional statistics,whose behavior can be emulated in artificially designed spin systems.Here we present an experimental emulation of creating anyonic excitations in a superconducting circuit that consists of four qubits, achieved by dynamically generating the ground and excited states of the toric code model, i.e., four-qubit Greenberger-Horne-Zeilinger states. The anyonic braiding is implemented via single-qubit rotations: a phase shift of pi related to braiding, the hallmark of Abelian 1/2 anyons, has been observed through a Ramsey-type interference measurement.
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.52 and 0.67, significantly larger than the 0.25 achieved with a classical algorithm. This constitutes a proof-of-concept for the quantum speed-up of electrical quantum processors.