Perturbative gadgets for gate-based quantum computing: Nonrecursive constructions without subspace restrictions

被引:1
|
作者
Cichy, Simon [1 ,2 ]
Faehrmann, Paul K. [1 ]
Khatri, Sumeet [1 ]
Eisert, Jens [1 ,3 ,4 ]
机构
[1] Free Univ Berlin, Dahlem Ctr Complex Quantum Syst, D-14195 Berlin, Germany
[2] Swiss Fed Inst Technol, Inst Theoret Phys, CH-8093 Zurich, Switzerland
[3] Helmholtz Zentrum Berlin Mat & Energie, Hahn Meitner Pl 1, D-14109 Berlin, Germany
[4] Fraunhofer Heinrich Hertz Inst, D-10587 Berlin, Germany
关键词
COMPLEXITY;
D O I
10.1103/PhysRevA.109.052624
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Perturbative gadgets are a tool to encode part of a Hamiltonian, usually the low-energy subspace, into a different Hamiltonian with favorable properties, for instance, reduced locality. Many constructions of perturbative gadgets have been proposed over the years. Still, all of them are restricted in some ways: Either they apply to some specific classes of Hamiltonians, they involve recursion to reduce locality, or they are limited to studying time evolution under the gadget Hamiltonian, e.g., in the context of adiabatic quantum computing, and thus involve subspace restrictions. In this work, we fill the gap by introducing a versatile universal, nonrecursive, nonadiabatic perturbative gadget construction without subspace restrictions, that encodes an arbitrary many-body Hamiltonian into the low-energy subspace of a three-body Hamiltonian and is therefore applicable to gate-based quantum computing. Our construction requires rk additional qubits for a k-body Hamiltonian comprising r terms. Besides a specific gadget construction, we also provide a recipe for constructing similar gadgets, which can be tailored to different properties, which we discuss.
引用
收藏
页数:22
相关论文
共 50 条
  • [41] Computational Assessment of Silicon Quantum Gate Based on Detuning Mechanism for Quantum Computing
    Wu, Tong
    Guo, Jing
    IEEE TRANSACTIONS ON ELECTRON DEVICES, 2018, 65 (12) : 5530 - 5536
  • [42] Intelligent pharmaceutical patent search on a near-term gate-based quantum computer (vol 12, 175, 2022)
    Wang, Pei-Hua
    Chen, Jen-Hao
    Tseng, Yufeng Jane
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [43] Quantum computing based on space states without charge transfer
    Vyurkov, V.
    Filippov, S.
    Gorelik, L.
    PHYSICS LETTERS A, 2010, 374 (33) : 3285 - 3291
  • [44] Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing
    Wang, Dong-Sheng
    PHYSICAL REVIEW A, 2020, 101 (05)
  • [45] Rotated majority gate-based 2n-bit full adder design in quantum-dot cellular automata nanotechnology
    Kassa, Sankit
    Gupta, Prateek
    Kumar, Manoj
    Stephan, Thompson
    Kannan, Ramani
    CIRCUIT WORLD, 2022, 48 (01) : 48 - 63
  • [46] A combined three and five inputs majority gate-based high performance coplanar full adder in quantum-dot cellular automata
    Danehdaran F.
    Angizi S.
    Bagherian Khosroshahy M.
    Navi K.
    Bagherzadeh N.
    International Journal of Information Technology, 2021, 13 (3) : 1165 - 1177
  • [47] Barrier versus tilt exchange gate operations in spin-based quantum computing
    Shim, Yun-Pil
    Tahan, Charles
    PHYSICAL REVIEW B, 2018, 97 (15)
  • [48] Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions
    Sornborger, Andrew T.
    Stancil, Phillip
    Geller, Michael R.
    QUANTUM INFORMATION PROCESSING, 2018, 17 (05)
  • [49] Design and Evaluation of a 5-Input Majority Gate-Based Content-Addressable Memory Cell in Quantum-Dot Cellular Automata
    Khosroshahy, Milad Bagherian
    Moaiyeri, Mohammad Hossein
    Navi, Keivan
    2017 19TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SYSTEMS (CADS), 2017, : 4 - 9
  • [50] Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions
    Andrew T. Sornborger
    Phillip Stancil
    Michael R. Geller
    Quantum Information Processing, 2018, 17