Fast and Robust Population Transfer with a Josephson Qutrit Via Shortcut to Adiabaticity
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Modern Quantum Technologies of Information Security
MODERN QUANTUM TECHNOLOGIES OF INFORMATION SECURITY Oleksandr Korchenko 1, Yevhen Vasiliu 2, Sergiy Gnatyuk 3 1,3 Dept of Information Security Technologies, National Aviation University, Kosmonavta Komarova Ave 1, 03680 Kyiv, Ukraine 2Dept of Information Technologies and Control Systems, Odesa National Academy of Telecommunications n.a. O.S. Popov, Koval`ska Str 1, 65029 Odesa, Ukraine E-mails: [email protected], [email protected], [email protected] In this paper, the systematisation and classification of modern quantum technologies of information security against cyber-terrorist attack are carried out. The characteristic of the basic directions of quantum cryptography from the viewpoint of the quantum technologies used is given. A qualitative analysis of the advantages and disadvantages of concrete quantum protocols is made. The current status of the problem of practical quantum cryptography use in telecommunication networks is considered. In particular, a short review of existing commercial systems of quantum key distribution is given. 1. Introduction Today there is virtually no area where information technology ( ІТ ) is not used in some way. Computers support banking systems, control the work of nuclear reactors, and control aircraft, satellites and spacecraft. The high level of automation therefore depends on the security level of IT. The latest achievements in communication systems are now applied in aviation. These achievements are public switched telephone network (PSTN), circuit switched public data network (CSPDN), packet switched public data network (PSPDN), local area network (LAN), and integrated services digital network (ISDN) [73]. These technologies provide data transmission systems of various types: surface-to-surface, surface-to-air, air-to-air, and space telecommunication. -
Quantum Information in the Posner Model of Quantum Cognition
Quantum information in quantum cognition Nicole Yunger Halpern1, 2 and Elizabeth Crosson1 1Institute for Quantum Information and Matter, Caltech, Pasadena, CA 91125, USA 2Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106, USA (Dated: November 15, 2017) Matthew Fisher recently postulated a mechanism by which quantum phenomena could influence cognition: Phosphorus nuclear spins may resist decoherence for long times. The spins would serve as biological qubits. The qubits may resist decoherence longer when in Posner molecules. We imagine that Fisher postulates correctly. How adroitly could biological systems process quantum information (QI)? We establish a framework for answering. Additionally, we apply biological qubits in quantum error correction, quantum communication, and quantum computation. First, we posit how the QI encoded by the spins transforms as Posner molecules form. The transformation points to a natural computational basis for qubits in Posner molecules. From the basis, we construct a quantum code that detects arbitrary single-qubit errors. Each molecule encodes one qutrit. Shifting from information storage to computation, we define the model of Posner quantum computation. To illustrate the model's quantum-communication ability, we show how it can teleport information in- coherently: A state's weights are teleported; the coherences are not. The dephasing results from the entangling operation's simulation of a coarse-grained Bell measurement. Whether Posner quantum computation is universal remains an open question. However, the model's operations can efficiently prepare a Posner state usable as a resource in universal measurement-based quantum computation. The state results from deforming the Affleck-Lieb-Kennedy-Tasaki (AKLT) state and is a projected entangled-pair state (PEPS). -
Optimization of Transmon Design for Longer Coherence Time
Optimization of transmon design for longer coherence time Simon Burkhard Semester thesis Spring semester 2012 Supervisor: Dr. Arkady Fedorov ETH Zurich Quantum Device Lab Prof. Dr. A. Wallraff Abstract Using electrostatic simulations, a transmon qubit with new shape and a large geometrical size was designed. The coherence time of the qubits was increased by a factor of 3-4 to about 4 µs. Additionally, a new formula for calculating the coupling strength of the qubit to a transmission line resonator was obtained, allowing reasonably accurate tuning of qubit parameters prior to production using electrostatic simulations. 2 Contents 1 Introduction 4 2 Theory 5 2.1 Coplanar waveguide resonator . 5 2.1.1 Quantum mechanical treatment . 5 2.2 Superconducting qubits . 5 2.2.1 Cooper pair box . 6 2.2.2 Transmon . 7 2.3 Resonator-qubit coupling (Jaynes-Cummings model) . 9 2.4 Effective transmon network . 9 2.4.1 Calculation of CΣ ............................... 10 2.4.2 Calculation of β ............................... 10 2.4.3 Qubits coupled to 2 resonators . 11 2.4.4 Charge line and flux line couplings . 11 2.5 Transmon relaxation time (T1) ........................... 11 3 Transmon simulation 12 3.1 Ansoft Maxwell . 12 3.1.1 Convergence of simulations . 13 3.1.2 Field integral . 13 3.2 Optimization of transmon parameters . 14 3.3 Intermediate transmon design . 15 3.4 Final transmon design . 15 3.5 Comparison of the surface electric field . 17 3.6 Simple estimate of T1 due to coupling to the charge line . 17 3.7 Simulation of the magnetic flux through the split junction . -
Parafermions in a Kagome Lattice of Qubits for Topological Quantum Computation
PHYSICAL REVIEW X 5, 041040 (2015) Parafermions in a Kagome Lattice of Qubits for Topological Quantum Computation Adrian Hutter, James R. Wootton, and Daniel Loss Department of Physics, University of Basel, Klingelbergstrasse 82, CH-4056 Basel, Switzerland (Received 3 June 2015; revised manuscript received 16 September 2015; published 14 December 2015) Engineering complex non-Abelian anyon models with simple physical systems is crucial for topological quantum computation. Unfortunately, the simplest systems are typically restricted to Majorana zero modes (Ising anyons). Here, we go beyond this barrier, showing that the Z4 parafermion model of non-Abelian anyons can be realized on a qubit lattice. Our system additionally contains the Abelian DðZ4Þ anyons as low-energetic excitations. We show that braiding of these parafermions with each other and with the DðZ4Þ anyons allows the entire d ¼ 4 Clifford group to be generated. The error-correction problem for our model is also studied in detail, guaranteeing fault tolerance of the topological operations. Crucially, since the non- Abelian anyons are engineered through defect lines rather than as excitations, non-Abelian error correction is not required. Instead, the error-correction problem is performed on the underlying Abelian model, allowing high noise thresholds to be realized. DOI: 10.1103/PhysRevX.5.041040 Subject Areas: Condensed Matter Physics, Quantum Physics, Quantum Information I. INTRODUCTION Non-Abelian anyons supported by a qubit system Non-Abelian anyons exhibit exotic physics that would typically are Majorana zero modes, also known as Ising – make them an ideal basis for topological quantum compu- anyons [12 15]. A variety of proposals for experimental tation [1–3]. -
Arxiv:1807.01863V1 [Quant-Ph] 5 Jul 2018 Β 2| +I Γ 2 =| I 1
Quantum Error Correcting Code for Ternary Logic Ritajit Majumdar1,∗ Saikat Basu2, Shibashis Ghosh2, and Susmita Sur-Kolay1y 1Advanced Computing & Microelectronics Unit, Indian Statistical Institute, India 2A. K. Choudhury School of Information Technology, University of Calcutta, India Ternary quantum systems are being studied because these provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the coefficient of one of the basis states is zero. Hence both (2 × 2)-dimensional as well as (3 × 3)-dimensional Pauli errors can occur on qutrits. In this paper, we (i) explore the possible (2 × 2)-dimensional as well as (3 × 3)-dimensional Pauli errors in qutrits and show that any pairwise bit swap error can be expressed as a linear combination of shift errors and phase errors, (ii) propose a new type of error called quantum superposition error and show its equivalence to arbitrary rotation, (iii) formulate a nine qutrit code which can correct a single error in a qutrit, and (iv) provide its stabilizer and circuit realization. I. INTRODUCTION errors or (d d)-dimensional errors only and no explicit circuit has been× presented. Quantum computers hold the promise of reducing the Main Contributions: In this paper, we study error cor- computational complexity of certain problems. However, rection in qutrits considering both (2 2)-dimensional × quantum systems are highly sensitive to errors; even in- as well as (3 3)-dimensional errors. We have intro- × teraction with environment can cause a change of state. -
Quantum Computers
Quantum Computers ERIK LIND. PROFESSOR IN NANOELECTRONICS Erik Lind EIT, Lund University 1 Disclaimer Erik Lind EIT, Lund University 2 Quantum Computers Classical Digital Computers Why quantum computers? Basics of QM • Spin-Qubits • Optical qubits • Superconducting Qubits • Topological Qubits Erik Lind EIT, Lund University 3 Classical Computing • We build digital electronics using CMOS • Boolean Logic • Classical Bit – 0/1 (Defined as a voltage level 0/+Vdd) +vDD +vDD +vDD Inverter NAND Logic is built by connecting gates Erik Lind EIT, Lund University 4 Classical Computing • We build digital electronics using CMOS • Boolean Logic • Classical Bit – 0/1 • Very rubust! • Modern CPU – billions of transistors (logic and memory) • We can keep a logical state for years • We can easily copy a bit • Mainly through irreversible computing However – some problems are hard to solve on a classical computer Erik Lind EIT, Lund University 5 Computing Complexity Searching an unsorted list Factoring large numbers Grovers algo. – Shor’s Algorithm BQP • P – easy to solve and check on a 푛 classical computer ~O(N) • NP – easy to check – hard to solve on a classical computer ~O(2N) P P • BQP – easy to solve on a quantum computer. ~O(N) NP • BQP is larger then P • Some problems in P can be more efficiently solved by a quantum computer Simulating quantum systems Note – it is still not known if 푃 = 푁푃. It is very hard to build a quantum computer… Erik Lind EIT, Lund University 6 Basics of Quantum Mechanics A state is a vector (ray) in a complex Hilbert Space Dimension of space – possible eigenstates of the state For quantum computation – two dimensional Hilbert space ۧ↓ Example - Spin ½ particle - ȁ↑ۧ 표푟 Spin can either be ‘up’ or ‘down’ Erik Lind EIT, Lund University 7 Basics of Quantum Mechanics • A state of a system is a vector (ray) in a complex vector (Hilbert) Space. -
Quantum Algorithms for Classical Lattice Models
Home Search Collections Journals About Contact us My IOPscience Quantum algorithms for classical lattice models This content has been downloaded from IOPscience. Please scroll down to see the full text. 2011 New J. Phys. 13 093021 (http://iopscience.iop.org/1367-2630/13/9/093021) View the table of contents for this issue, or go to the journal homepage for more Download details: IP Address: 147.96.14.15 This content was downloaded on 16/12/2014 at 15:54 Please note that terms and conditions apply. New Journal of Physics The open–access journal for physics Quantum algorithms for classical lattice models G De las Cuevas1,2,5, W Dür1, M Van den Nest3 and M A Martin-Delgado4 1 Institut für Theoretische Physik, Universität Innsbruck, Technikerstraße 25, A-6020 Innsbruck, Austria 2 Institut für Quantenoptik und Quanteninformation der Österreichischen Akademie der Wissenschaften, Innsbruck, Austria 3 Max-Planck-Institut für Quantenoptik, Hans-Kopfermann-Strasse 1, D-85748 Garching, Germany 4 Departamento de Física Teórica I, Universidad Complutense, 28040 Madrid, Spain E-mail: [email protected] New Journal of Physics 13 (2011) 093021 (35pp) Received 15 April 2011 Published 9 September 2011 Online at http://www.njp.org/ doi:10.1088/1367-2630/13/9/093021 Abstract. We give efficient quantum algorithms to estimate the partition function of (i) the six-vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi-2D square lattice and (iv) the Z2 lattice gauge theory on a 3D square lattice. -
Control of the Geometric Phase in Two Open Qubit–Cavity Systems Linked by a Waveguide
entropy Article Control of the Geometric Phase in Two Open Qubit–Cavity Systems Linked by a Waveguide Abdel-Baset A. Mohamed 1,2 and Ibtisam Masmali 3,* 1 Department of Mathematics, College of Science and Humanities, Prince Sattam bin Abdulaziz University, Al-Aflaj 710-11912, Saudi Arabia; [email protected] 2 Faculty of Science, Assiut University, Assiut 71516, Egypt 3 Department of Mathematics, Faculty of Science, Jazan University, Gizan 82785, Saudi Arabia * Correspondence: [email protected] Received: 28 November 2019; Accepted: 8 January 2020; Published: 10 January 2020 Abstract: We explore the geometric phase in a system of two non-interacting qubits embedded in two separated open cavities linked via an optical fiber and leaking photons to the external environment. The dynamical behavior of the generated geometric phase is investigated under the physical parameter effects of the coupling constants of both the qubit–cavity and the fiber–cavity interactions, the resonance/off-resonance qubit–field interactions, and the cavity dissipations. It is found that these the physical parameters lead to generating, disappearing and controlling the number and the shape (instantaneous/rectangular) of the geometric phase oscillations. Keywords: geometric phase; cavity damping; optical fiber 1. Introduction The mathematical manipulations of the open quantum systems, of the qubit–field interactions, depend on the ability of solving the master-damping [1] and intrinsic-decoherence [2] equations, analytically/numerically. To remedy the problems of these manipulations, the quantum phenomena of the open systems were studied for limited physical circumstances [3–7]. The quantum geometric phase is a basic intrinsic feature in quantum mechanics that is used as the basis of quantum computation [8]. -
Physical Implementations of Quantum Computing
Physical implementations of quantum computing Andrew Daley Department of Physics and Astronomy University of Pittsburgh Overview (Review) Introduction • DiVincenzo Criteria • Characterising coherence times Survey of possible qubits and implementations • Neutral atoms • Trapped ions • Colour centres (e.g., NV-centers in diamond) • Electron spins (e.g,. quantum dots) • Superconducting qubits (charge, phase, flux) • NMR • Optical qubits • Topological qubits Back to the DiVincenzo Criteria: Requirements for the implementation of quantum computation 1. A scalable physical system with well characterized qubits 1 | i 0 | i 2. The ability to initialize the state of the qubits to a simple fiducial state, such as |000...⟩ 1 | i 0 | i 3. Long relevant decoherence times, much longer than the gate operation time 4. A “universal” set of quantum gates control target (single qubit rotations + C-Not / C-Phase / .... ) U U 5. A qubit-specific measurement capability D. P. DiVincenzo “The Physical Implementation of Quantum Computation”, Fortschritte der Physik 48, p. 771 (2000) arXiv:quant-ph/0002077 Neutral atoms Advantages: • Production of large quantum registers • Massive parallelism in gate operations • Long coherence times (>20s) Difficulties: • Gates typically slower than other implementations (~ms for collisional gates) (Rydberg gates can be somewhat faster) • Individual addressing (but recently achieved) Quantum Register with neutral atoms in an optical lattice 0 1 | | Requirements: • Long lived storage of qubits • Addressing of individual qubits • Single and two-qubit gate operations • Array of singly occupied sites • Qubits encoded in long-lived internal states (alkali atoms - electronic states, e.g., hyperfine) • Single-qubit via laser/RF field coupling • Entanglement via Rydberg gates or via controlled collisions in a spin-dependent lattice Rb: Group II Atoms 87Sr (I=9/2): Extensively developed, 1 • P1 e.g., optical clocks 3 • Degenerate gases of Yb, Ca,.. -
In Situ Quantum Control Over Superconducting Qubits
! In situ quantum control over superconducting qubits Anatoly Kulikov M.Sc. A thesis submitted for the degree of Doctor of Philosophy at The University of Queensland in 2020 School of Mathematics and Physics ARC Centre of Excellence for Engineered Quantum Systems (EQuS) ABSTRACT In the last decade, quantum information processing has transformed from a field of mostly academic research to an applied engineering subfield with many commercial companies an- nouncing strategies to achieve quantum advantage and construct a useful universal quantum computer. Continuing efforts to improve qubit lifetime, control techniques, materials and fab- rication methods together with exploring ways to scale up the architecture have culminated in the recent achievement of quantum supremacy using a programmable superconducting proces- sor { a major milestone in quantum computing en route to useful devices. Marking the point when for the first time a quantum processor can outperform the best classical supercomputer, it heralds a new era in computer science, technology and information processing. One of the key developments enabling this transition to happen is the ability to exert more precise control over quantum bits and the ability to detect and mitigate control errors and imperfections. In this thesis, ways to efficiently control superconducting qubits are explored from the experimental viewpoint. We introduce a state-of-the-art experimental machinery enabling one to perform one- and two-qubit gates focusing on the technical aspect and outlining some guidelines for its efficient operation. We describe the software stack from the time alignment of control pulses and triggers to the data processing organisation. We then bring in the standard qubit manipulation and readout methods and proceed to describe some of the more advanced optimal control and calibration techniques. -
Reliably Distinguishing States in Qutrit Channels Using One-Way LOCC
Reliably distinguishing states in qutrit channels using one-way LOCC Christopher King Department of Mathematics, Northeastern University, Boston MA 02115 Daniel Matysiak College of Computer and Information Science, Northeastern University, Boston MA 02115 July 15, 2018 Abstract We present numerical evidence showing that any three-dimensional subspace of C3 ⊗ Cn has an orthonormal basis which can be reliably dis- tinguished using one-way LOCC, where a measurement is made first on the 3-dimensional part and the result used to select an optimal measure- ment on the n-dimensional part. This conjecture has implications for the LOCC-assisted capacity of certain quantum channels, where coordinated measurements are made on the system and environment. By measuring first in the environment, the conjecture would imply that the environment- arXiv:quant-ph/0510004v1 1 Oct 2005 assisted classical capacity of any rank three channel is at least log 3. Sim- ilarly by measuring first on the system side, the conjecture would imply that the environment-assisting classical capacity of any qutrit channel is log 3. We also show that one-way LOCC is not symmetric, by providing an example of a qutrit channel whose environment-assisted classical capacity is less than log 3. 1 1 Introduction and statement of results The noise in a quantum channel arises from its interaction with the environment. This viewpoint is expressed concisely in the Lindblad-Stinespring representation [6, 8]: Φ(|ψihψ|)= Tr U(|ψihψ|⊗|ǫihǫ|)U ∗ (1) E Here E is the state space of the environment, which is assumed to be initially prepared in a pure state |ǫi. -
Quantum Computing for Undergraduates: a True STEAM Case
Lat. Am. J. Sci. Educ. 6, 22030 (2019) Latin American Journal of Science Education www.lajse.org Quantum Computing for Undergraduates: a true STEAM case a b c César B. Cevallos , Manuel Álvarez Alvarado , and Celso L. Ladera a Instituto de Ciencias Básicas, Dpto. de Física, Universidad Técnica de Manabí, Portoviejo, Provincia de Manabí, Ecuador b Facultad de Ingeniería en Electricidad y Computación, Escuela Politécnica del Litoral, Guayaquil. Ecuador c Departamento de Física, Universidad Simón Bolívar, Valle de Sartenejas, Caracas 1089, Venezuela A R T I C L E I N F O A B S T R A C T Received: Agosto 15, 2019 The first quantum computers of 5-20 superconducting qubits are now available for free Accepted: September 20, 2019 through the Cloud for anyone who wants to implement arrays of logical gates, and eventually Available on-line: Junio 6, 2019 to program advanced computer algorithms. The latter to be eventually used in solving Combinatorial Optimization problems, in Cryptography or for cracking complex Keywords: STEAM, quantum computational chemistry problems, which cannot be either programmed or solved using computer, engineering curriculum, classical computers based on present semiconductor electronics. Moreover, Quantum physics curriculum. Advantage, i.e. computational power beyond that of conventional computers seems to be within our reach in less than one year from now (June 2018). It does seem unlikely that these E-mail addresses: new fast computers, based on quantum mechanics and superconducting technology, will ever [email protected] become laptop-like. Yet, within a decade or less, their physics, technology and programming [email protected] will forcefully become part, of the undergraduate curriculae of Physics, Electronics, Material [email protected] Science, and Computer Science: it is indeed a subject that embraces Sciences, Advanced Technologies and even Art e.g.