user

Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm

被引：10
|
作者：
Rao, MVP [1 ]
机构：
[1] Indian Inst Sci, Dept Comp Sci & Automat, Bangalore 560012, Karnataka, India
来源：
PHYSICAL REVIEW A | 2003年 / 67卷 / 05期
关键词：
D O I：
10.1103/PhysRevA.67.052306
中图分类号：
O43 [光学];
学科分类号：
070207 ; 0803 ;
摘要：
We present and solve a restricted Abelian hidden subgroup problem using the adiabatic quantum-computing paradigm. The time step complexity is shown to be a polynomial in the number of input qubits. This paper is a step towards looking at the Abelian hidden subgroup problem from a quantum adiabatic standpoint.
引用
收藏
页数：6
相关论文
共 50 条
  • [31] A Quantum-Computing-Based Method for Solving Quantum Confinement Problem in Semiconductor
    Yang, Ning
    Guo, Jing
    IEEE TRANSACTIONS ON ELECTRON DEVICES, 2023, 70 (03) : 1366 - 1373
  • [32] Title Paper: Natural computing: A problem solving paradigm with granular information processing
    Pal, Sankar K.
    Meher, Saroj K.
    APPLIED SOFT COMPUTING, 2013, 13 (09) : 3944 - 3955
  • [33] A quantum algorithm for the dihedral hidden subgroup problem based on lattice basis reduction algorithm
    Li, Fada
    Bao, Wansu
    Fu, Xiangqun
    CHINESE SCIENCE BULLETIN, 2014, 59 (21): : 2552 - 2557
  • [34] A quantum algorithm for the dihedral hidden subgroup problem based on lattice basis reduction algorithm
    Fada Li
    Wansu Bao
    Xiangqun Fu
    Chinese Science Bulletin, 2014, 59 (21) : 2552 - 2557
  • [35] An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
    Krovi, Hari
    Roetteler, Martin
    MATHEMATICAL METHODS IN COMPUTER SCIENCE: ESSAYS IN MEMORY OF THOMAS BETH, 2008, 5393 : 70 - 88
  • [36] Practical Quantum Computing: Solving the Wave Equation Using a Quantum Approach
    Suau, Adrien
    Staffelbach, Gabriel
    Calandra, Henri
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2021, 2 (01):
  • [37] Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
    Inui, Yoshifumi
    Le Gall, Francois
    QUANTUM INFORMATION & COMPUTATION, 2007, 7 (5-6) : 559 - 570
  • [38] Solving elevator scheduling problem using DNA computing approach
    Muhammad, MS
    Ueda, S
    Ono, O
    Watada, J
    Khalid, M
    SOFT COMPUTING AS TRANSDISCIPLINARY SCIENCE AND TECHNOLOGY, 2005, : 359 - 370
  • [39] Polynomial quantum computing algorithms for solving the dualization problem for positive Boolean functions
    Mezzini, Mauro
    Cuartero Gomez, Fernando
    Gonzalez, Jose Javier Paulet
    de la Cruz Calvo, Hernan Indibil
    Pascual, Vicente
    L. Pelayo, Fernando
    Quantum Machine Intelligence, 2024, 6 (02)
  • [40] Solving the Hamiltonian Cycle Problem using a Quantum Computer
    Mahasinghe, Anuradha
    Hua, Richard
    Dinneen, Michael J.
    Goyal, Rajni
    PROCEEDINGS OF THE AUSTRALASIAN COMPUTER SCIENCE WEEK MULTICONFERENCE (ACSW 2019), 2019,
12345