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 条
  • [1] Gate-based superconducting quantum computing
    Kwon, Sangil
    Tomonaga, Akiyoshi
    Bhai, Gopika Lakshmi
    Devitt, Simon J.
    Tsai, Jaw-Shen
    JOURNAL OF APPLIED PHYSICS, 2021, 129 (04)
  • [2] Gate-based quantum computing for protein design
    Khatami, Mohammad Hassan
    Mendes, Udson
    Wiebe, Nathan
    Kim, Philip
    PLOS COMPUTATIONAL BIOLOGY, 2023, 19 (04)
  • [3] Quantum Gate-Based Quantum Private Comparison
    Yan-Feng Lang
    International Journal of Theoretical Physics, 2020, 59 : 833 - 840
  • [4] Quantum Gate-Based Quantum Private Comparison
    Lang, Yan-Feng
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2020, 59 (03) : 833 - 840
  • [5] Feynman Meets Turing: The Infeasibility of Digital Compilers for Gate-Based Quantum Computing
    Boeck, Yannik N.
    Boche, Holger
    del Toro, Zoe Garcia
    Fitzek, Frank H. P.
    ICC 2024 - IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2024, : 2440 - 2445
  • [6] Benchmarking gate-based quantum computers
    Michielsen, Kristel
    Nocon, Madita
    Willsch, Dennis
    Jin, Fengping
    Lippert, Thomas
    De Raedt, Hans
    COMPUTER PHYSICS COMMUNICATIONS, 2017, 220 : 44 - 55
  • [7] Quantum reinforcement learningComparing quantum annealing and gate-based quantum computing with classical deep reinforcement learning
    Niels M. P. Neumann
    Paolo B. U. L. de Heer
    Frank Phillipson
    Quantum Information Processing, 22
  • [8] Quantum reinforcement learning Comparing quantum annealing and gate-based quantum computing with classical deep reinforcement learning
    Neumann, Niels M. P.
    de Heer, Paolo B. U. L.
    Phillipson, Frank
    QUANTUM INFORMATION PROCESSING, 2023, 22 (02)
  • [9] Transmission Gate-based Approximate Adders for Inexact Computing
    Yang, Zhixi
    Han, Jie
    Lombardi, Fabrizio
    PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL SYMPOSIUM ON NANOSCALE ARCHITECTURES (NANOARCH 15), 2015, : 145 - 150
  • [10] Cryptanalysis and Improvement of Quantum Gate-Based Quantum Private Comparison
    Duan Ming-Yi
    International Journal of Theoretical Physics, 2021, 60 : 195 - 199