Polynomial time quantum computation with advice

被引：23
|
作者：
Nishimura, H [1 ]
Yamakami, T [1 ]
机构：
[1] Univ Ottawa, Sch Informat Technol & Engn, Peterborough, ON K1N 6N5, Canada
来源：
INFORMATION PROCESSING LETTERS | 2004年 / 90卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
computational complexity; quantum circuit; advice function;
D O I：
10.1016/j.ipl.2004.02.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Advice is supplementary information that enhances the computational power of an underlying computation. This paper focuses on advice that is given in the form of a pure quantum state and examines the influence of such advice on the behaviors of an underlying polynomial-time quantum computation with bounded-effor probability. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：195 / 204
页数：10
相关论文
共 50 条
  • [21] A linguistic characterization of bounded oracle computation and probabilistic polynomial time
    Mitchell, J
    Mitchell, M
    Scedrov, A
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 725 - 733
  • [22] A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
    Yamakami, Tomoyuki
    JOURNAL OF SYMBOLIC LOGIC, 2020, 85 (04) : 1546 - 1587
  • [23] A Programming Language Characterizing Quantum Polynomial Time
    Hainry, Emmanuel
    Pechoux, Romain
    Silva, Mario
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2023, 2023, 13992 : 156 - 175
  • [24] ON THE COMPUTATION OF THE MINIMAL POLYNOMIAL OF A POLYNOMIAL MATRIX
    Karampetakis, Nicholas P.
    Tzekis, Panagiotis
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE, 2005, 15 (03) : 339 - 349
  • [25] Online computation with untrusted advice
    Angelopoulos, Spyros
    Durr, Christoph
    Jin, Shendan
    Kamali, Shahin
    Renault, Marc
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2024, 144
  • [26] Time-optimal holonomic quantum computation
    Alves, Gabriel O.
    Sjoeqvist, Erik
    PHYSICAL REVIEW A, 2022, 106 (03)
  • [27] CONSTRUCTIVE NON-COMMUTATIVE RANK COMPUTATION IS IN DETERMINISTIC POLYNOMIAL TIME
    Ivanyos, Gabor
    Qiao, Youming
    Subrahmanyam, K. V.
    COMPUTATIONAL COMPLEXITY, 2018, 27 (04) : 561 - 593
  • [28] Constructive non-commutative rank computation is in deterministic polynomial time
    Gábor Ivanyos
    Youming Qiao
    K. V. Subrahmanyam
    computational complexity, 2018, 27 : 561 - 593
  • [29] Polynomial-time computation of exact correlated equilibrium in compact games
    Jiang, Albert Xin
    Leyton-Brown, Kevin
    GAMES AND ECONOMIC BEHAVIOR, 2015, 91 : 347 - 359
  • [30] Symbolic computation of correction function for polynomial time response of intrinsic thermocouples
    Ivantcheva, ZM
    Cotta, RM
    Mikhailov, MD
    INTERNATIONAL COMMUNICATIONS IN HEAT AND MASS TRANSFER, 2004, 31 (08) : 1133 - 1141
12345