A Programming Language Characterizing Quantum Polynomial Time

被引：2

作者：

Hainry, Emmanuel ^{[1
]}

Pechoux, Romain ^{[1
]}

Silva, Mario ^{[1
]}

机构：

[1] Univ Lorraine, LORIA, Inria, CNRS, F-54000 Nancy, France

来源：

FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2023 | 2023年 / 13992卷

关键词：

D O I：

10.1007/978-3-031-30829-1_8

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. We finally present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits.

引用

页码：156 / 175

页数：20

共 50 条

[41] Quantum computing, postselection, and probabilistic polynomial-time
Aaronson, S
PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2005, 461 (2063): : 3473 - 3482
[42] Learning Quantum Hamiltonians at Any Temperature in Polynomial Time
Bakshi, Ainesh
Liu, Allen
Moitra, Ankur
Tang, Ewin
PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1470 - 1477
[43] Polynomial-Time Classical Simulation of Quantum Ferromagnets
Bravyi, Sergey
Gosset, David
PHYSICAL REVIEW LETTERS, 2017, 119 (10)
[44] Characterizing polynomial Ramsey quantifiers
de Haan, Ronald
Szymanik, Jakub
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2019, 29 (06) : 896 - 908
[45] Quantum circuits that can be simulated classically in polynomial time
Valiant, LG
SIAM JOURNAL ON COMPUTING, 2002, 31 (04) : 1229 - 1254
[46] GENERALIZED POLYNOMIAL PROGRAMMING
BLAU, GE
WILDE, DJ
CANADIAN JOURNAL OF CHEMICAL ENGINEERING, 1969, 47 (03): : 317 - &
[47] An exterior point polynomial-time algorithm for convex quadratic programming
Da Gang Tian
Computational Optimization and Applications, 2015, 61 : 51 - 78
[48] A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem
Liang, Zhiyao
Subramani, K.
KNOWLEDGE ENGINEERING AND MANAGEMENT, 2011, 123 : 201 - +
[49] Disruption recovery at airports: Integer programming formulations and polynomial time algorithms
Manyem, Prabhu
DISCRETE APPLIED MATHEMATICS, 2018, 242 : 102 - 117
[50] An exterior point polynomial-time algorithm for convex quadratic programming
Tian, Da Gang
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 61 (01) : 51 - 78

← 1 2 3 4 5 →