We analyse stability of the four-dimensional Kitaev model - a candidate for scalable quantum memory - in finite temperature within the weak coupling Markovian limit. It is shown that, below a critical temperature, certain topological qubit observables X and Z possess relaxation times exponentially long in the size of the system. Their construction involves polynomial in system's size algorithm which uses as an input the results of measurements performed on all individual spins. We also discuss the drawbacks of such candidate for quantum memory and mention the implications of the stability of qubit for statistical mechanics.
Inspired by the Solovay-Kitaev decomposition for approximating unitary operations as a sequence of operations selected from a universal quantum computing gate set, we introduce a method for approximating any single-qubit channel using single-qubit gates and the controlled-NOT (CNOT). Our approach uses the decomposition of the single-qubit channel into a convex combination of "quasiextreme" channels. Previous techniques for simulating general single-qubit channels would require as many as 20 CNOT gates, whereas ours only needs one, bringing it within the range of current experiments.
The Solovay-Kitaev theorem allows us to approximate any single-qubit gate to arbitrary accuracy with a finite sequence of fundamental operations from a universal set of gates. Inspired by this decomposition, we present a quantum channel simulator capable of implementing any completely positive trace-preserving map. Our realization consists of one ancillary qubit, encoded in the transverse mode of a laser beam (orbital degree of freedom), one qubit system, encoded in its polarization (spin), one spin-orbit CNOT gate and four single-qubit operations performed with prisms and polarization compone…
The Gottesman-Kitaev-Preskill encoding of a qubit in a harmonic oscillator is a promising building block towards fault-tolerant quantum computation. Recently, this encoding was experimentally demonstrated for the first time in trapped-ion and superconducting circuit systems. However, these systems lack some of the Gaussian operations which are critical to efficiently manipulate the encoded qubits. In particular, homodyne detection, which is the preferred method for readout of the encoded qubit, is not readily available, heavily limiting the readout fidelity. Here, we present an alternative rea…
Quantum resource theories are a powerful framework to characterize and quantify relevant quantum phenomena and identify processes that optimize their use for different tasks. Here, we define a resource measure for magic, the sought-after property in most fault-tolerant quantum computers. In contrast to previous literature, our formulation is based on bosonic codes, well-studied tools in continuous-variable quantum computation. Particularly, we use the Gottesman-Kitaev-Preskill code to represent multi-qubit states and consider the resource theory for the Wigner negativity. Our techniques are us…
Gottesman-Kitaev-Preskill (GKP) qubit is a promising ingredient for fault-tolerant quantum computation (FTQC) in optical continuous variables due to its advantage of noise tolerance and scalability. However, one of the main problems in the preparation of the optical GKP qubit is the difficulty in obtaining the nonlinearity. Cross-Kerr interaction is one of the promising candidates for this nonlinearity. There is no existing scheme to use the cross-Kerr interaction to generate the optical GKP qubit for FTQC. In this work, we propose a generation method of the GKP qubit by using a cross-Kerr int…
Present quantum computers often work with distinguishable qubits as their computational units. In order to simulate indistinguishable fermionic particles, it is first required to map the fermionic state to the state of the qubits. The Bravyi-Kitaev Superfast (BKSF) algorithm can be used to accomplish this mapping. The BKSF mapping has connections to quantum error correction and opens the door to new ways of understanding fermionic simulation in a topological context. Here, we present the first detailed exposition of BKSF algorithm for molecular simulation. We provide the BKSF transformed qubit…
Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a …
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use t…
Quantum simulation is an important application of future quantum computers with applications in quantum chemistry, condensed matter, and beyond. Quantum simulation of fermionic systems presents a specific challenge. The Jordan-Wigner transformation allows for representation of a fermionic operator by O(n) qubit operations. Here we develop an alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev [S. B. Bravyi, A.Yu. Kitaev, Annals of Physics 298, 210-226 (2002)], that reduces the simulation cost to O(log n) qubit operations for one fermionic operation. We ap…
We introduce a new approach to Gottesman-Kitaev-Preskill (GKP) states that treats their finite-energy version in an exact manner. Based on this analysis, we develop new qubit-oscillator circuits that autonomously stabilize a GKP manifold, correcting errors without relying on qubit measurements. Finally, we show numerically that logical information encoded in GKP states is very robust against typical oscillator noise sources when stabilized by these new circuits.
Robust Spin Qubit Coupler via Minimal Kitaev Chain
Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Beijing Key Laboratory of Quantum Devices and School of Electronics, Peking University（北京大学电子学院）
Quantum repeaters are a promising platform for realizing long-distance quantum communication and thus could form the backbone of a secure quantum internet, a scalable quantum network, or a distributed quantum computer. Repeater protocols that encode information in single- or multi-photon states are limited by transmission losses and the cost of implementing entangling gates or Bell measurements. In this work, we consider implementing a quantum repeater protocol using Gottesman-Kitaev-Preskill (GKP) qubits. These qubits are natural elements for quantum repeater protocols, because they allow for…
Majorana-zero-modes (MZMs) were predicted to exist as edge states of a physical system called the Kitaev chain. MZMs should host particles that are their own antiparticles and could be used as a basis for a qubit which is robust-to-noise. However, all attempts to prove their existence gave inconclusive results. Here, the Kitaev chain is exactly solved with a quantum computing methodology and properties of MZMs are probed by generating eigenstates of the Kitev Hamiltonian on 3 noisy qubits of a publicly available quantum computer. After an ontological elaboration I show that two eigenstates of …
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the Auxiliary Fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical …
We analyze the Bures metric over the canonical thermal states for the Kitaev honeycomb mode. In this way the effects of finite temperature on topological phase transitions can be studied. Different regions in the parameter space of the model can be clearly identified in terms of different temperature scaling behavior of the Bures metric tensor. Furthermore, we show a simple relation between the metric elements and the crossover temperature between the quasi-critical and the quasi-classical regions. These results extend the ones of [29,30] to finite temperatures.
We propose a protected qubit which is `dual' to a suggestion of a superconducting current mirror qubit [A. Kitaev, arXiv:0609441 (2006)]. Our construction can be regarded as the magnetic analogue of Kitaev's proposal: it inherits the intrinsic fault-tolerance of the current mirror qubit, but may perform better than it in the laboratory, since magnetic noise is generally less of a problem than electric noise. We adapt the scheme for universal fault-tolerant quantum computation proposed by Kitaev to our construction.
Modeling Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits
ARC Centre of Excellence for Engineered Quantum Systems, School of Physics, The University of Sydney（悉尼大学工程量子系统卓越研究中心物理学院）；QuTech, Delft University of Technology（代尔夫特理工大学QuTech）；Faculty of EEMCS, Delft University of Technology（代尔夫特理工大学EEMCS学院）；AWS Center for Quantum Computing（亚马逊云科技量子计算中心）；California Institute of Technology（加州理工学院）
This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of $π/ 2^k$, into an efficient fault-tolerant form using only Hadamard, controlled-{\sc not}, and $π/ 8$ gates. The algorithm runs in $O(\log^{2.71}(1/ε))$ time, and produces as output a sequence of $O(\log^{3.97}(1/ε))$ quantum gates which is guaranteed to approximate the desired quantum …
Remote Gottesman-Kitaev-Preskill Entanglement Generation between Trapped Ions
School of Mathematical and Physical Sciences, Keio University（庆应义塾大学数理科学学院）；Department of Electronics and Electrical Engineering, Keio University（庆应义塾大学电子电气工程系）；Advanced ICT Research Institute, National Institute of Information and Communications Technology (NICT)（信息通信研究机构高级ICT研究所）
Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version, and realizing the ground states in a superconducting quantum processor. The teleportation tran…
We derive a theory for the generation of arbitrary spin-spin interactions in superconducting circuits via periodic time modulation of the individual qubits or the qubit-qubit interactions. The modulation frequencies in our approach are in the microwave or radio frequency regime so that the required fields can be generated with standard generators. Among others, our approach is suitable for generating spin lattices that exhibit quantum spin liquid behavior such as Kitaev's honeycomb model.
In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman-Kitaev-Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum computation in discrete-variable (DV) systems, i.e. non-stabilizer states, and negativity of the Wigner function in CV architectures, which is a necessary requirement for quantum advantage. In particular, we show that the lowest Wigner logarithmic negativity of qubit states encoded in CV with the GKP mapping corresponds to encoded stabilizer states, while t…
We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries. Using this tool, we study a generalization of Kitaev's code based on surfaces with mixed boundaries. This construction includes both Bravyi and Kitaev's and Freedman and Meyer's extension of Kitaev's toric code. We argue that our generalization offers a denser storage of quantum information. In a planar architecture, we obtain a three-fold overhead reduction over the standard architecture consisting of a punctured square lattice.
We show that one can quantum simulate the dynamics of a Sachdev-Ye-Kitaev model with $N$ Majorana modes for time $t$ to precision $ε$ with gate complexity $O(N^{7/2} t + N^{5/2} t \,{\rm polylog}(N/ ε))$. In addition to scaling sublinearly in the number of Hamiltonian terms, this gate complexity represents an exponential improvement in $1/ε$ and large polynomial improvement in $N$ and $t$ over prior state-of-the-art algorithms which scale as $O(N^{10} t^2 / ε)$. Our approach involves a variant of the qubitization technique in which we encode the Hamiltonian $H$ as an asymmetric projection of a…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum computing with error correction. We show that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements. Fault tolerance is possible with sufficient squeezing and low enough external noise. Thus, Gaussian operations are sufficient for fault-tolerant, uni…
We propose a quantum protocol that allows preparing a ground state (GS) of the honeycomb Kitaev model. Our approach efficiently uses underlying symmetries and techniques from topological error correction. It is based on the stabilization procedure, the developed centralizer ansatz, and utilizes the vortex basis description as the most advantageous for qubit-based simulations. We demonstrate the high fidelity preparation of spin liquid ground states for the original Kitaev model, getting the exact GS for N=24 spins using 230 two-qubit operations. We then extend the variational procedure to non-…
Zhejiang Key Laboratory of Micro-Nano Quantum Chips and Quantum Control, and School of Physics, Zhejiang University（浙江大学微纳量子芯片与量子控制浙江省重点实验室和物理学院）；Department of Physics, ETH Zürich（苏黎世联邦理工学院物理系）
Majorana parity qubit in coupled minimal Kitaev chains
QuTech and Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学奎克研究所和卡弗里纳米科学研究所）；Department of Applied Physics, Eindhoven University of Technology（埃因霍温理工大学应用物理系）
The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by Daniel Gottesman, Alexei Kitaev, and John Preskill as a way to encode a qubit in an oscillator. The GKP codewords are coherent superpositions of periodically displaced squeezed vacuum states. Because of the challenge of merely preparing the codewords, the GKP code was for a long time considered to be impractical. However, the remarkable developments in quantum hardware and control technology in the last two decades has made the GKP code a frontrunner in the race to build practical, fault-tolerant bosonic quantum technology. In th…
Anyons, quasiparticles living in two-dimensional spaces with exotic exchange statistics, can serve as the fundamental units for fault-tolerant quantum computation. However, experimentally demonstrating anyonic statistics is a challenge due to the technical limitations of current experimental platforms. Here, we take a state perpetration approach to mimic anyons in the Kitaev lattice model using a 7-qubit nuclear magnetic resonance quantum simulator. Anyons are created by dynamically preparing the ground and excited states of the 7-qubit Kitaev lattice model, and are subsequently braided along …
We compute rigorously the ground and equilibrium states for Kitaev's model in 2D, both the finite and infinite version, using an analogy with the 1D Ising ferromagnet. Next, we investigate the structure of the reduced dynamics in the presence of thermal baths in the Markovian regime. Special attention is paid to the dynamics of the topological freedoms which have been proposed for storing quantum information.
We analyze the performance of a generalized Kitaev's phase estimation algorithm where N phase gates, acting on $M$ qubits prepared in a product state, may be distributed in an arbitrary way. Unlike the standard algorithm, where the mean square error scales as 1/N, the optimal generalizations offer the Heisenberg $1/N^2$ error scaling and we show that they are in fact very close to the fundamental Bayesian estimation bound. We also demonstrate that the optimality of the algorithm breaks down when losses are taken into account, in which case the performance is inferior to the optimal entanglemen…
Thermalisation is a probabilistic process. As such, it is generally expected that when we increase the temperature of a system its classical behaviour dominates its quantum coherences. By employing the Gibbs state of a translationally invariant quantum spin liquid - Kitaev's honeycomb lattice model - we demonstrate that an insulating phase at $T=0$ becomes metallic purely by increasing temperature. In particular, we compute the finite temperature distribution of energies and show that it diverges logarithmically, as we move to small energies. The corresponding wave functions become critical al…
