Knowledge

Exact quantum polynomial time

Source đź“ť

1081: 1071: 36: 131:
In the original definition of EQP, each language was computed by a single quantum Turing machine (QTM), using a finite gate set whose amplitudes could be computed in polynomial time. However, some results have required the use of an infinite gate set. The amplitudes in the gate set are typically
270: 201: 232: 1117: 1514: 962: 863: 524: 425: 116:
with zero error probability and in guaranteed worst-case polynomial time. It is the quantum analogue of the complexity class 
750: 46: 1074: 260: 1032: 61: 1519: 608: 194: 1479: 1084: 972: 225: 79: 1110: 900: 558: 17: 895: 623: 603: 93: 890: 402: 923: 745: 309: 187: 928: 796: 387: 218: 167: 1103: 952: 708: 568: 342: 297: 241: 1495: 1302: 824: 696: 593: 469: 397: 304: 175: 57: 53: 633: 598: 494: 437: 1484: 806: 779: 755: 718: 509: 442: 377: 362: 332: 255: 957: 691: 583: 553: 352: 1438: 1027: 791: 784: 531: 1433: 1428: 947: 573: 499: 464: 1423: 737: 486: 337: 8: 1056: 1009: 839: 613: 367: 347: 282: 277: 772: 618: 420: 357: 1443: 1036: 681: 588: 545: 476: 392: 372: 327: 287: 265: 1407: 1297: 1229: 1219: 1126: 703: 653: 430: 113: 109: 1402: 1392: 1349: 1339: 1332: 1322: 1312: 1270: 1265: 1260: 1244: 1224: 1202: 1197: 1192: 1180: 1175: 1170: 1165: 829: 767: 457: 452: 147: 1397: 1285: 1207: 1160: 938: 915: 882: 686: 563: 171: 142: 117: 210: 1508: 760: 578: 504: 980: 905: 1275: 1185: 990: 844: 382: 1387: 1212: 1051: 985: 849: 1382: 1095: 834: 125: 1377: 1372: 1317: 1140: 1019: 995: 854: 819: 128:
are expected to run in polynomial time, but may not always do so.
1367: 1046: 663: 1474: 1469: 1344: 1327: 1023: 519: 1464: 1459: 1280: 292: 1292: 1150: 1041: 514: 447: 1307: 1239: 1234: 1155: 1145: 658: 643: 121: 485: 1506: 240: 1111: 226: 195: 1118: 1104: 233: 219: 202: 188: 80:Learn how and when to remove this message 751:Continuous-variable quantum information 14: 1507: 1125: 1099: 214: 153: 29: 45:may contain improper references to 24: 1515:Theoretical computer science stubs 25: 1531: 1480:Probabilistically checkable proof 1080: 1079: 1070: 1069: 34: 122:bounded-error quantum computing 94:computational complexity theory 13: 1: 746:Adiabatic quantum computation 135: 98:exact quantum polynomial time 797:Topological quantum computer 174:. You can help Knowledge by 168:theoretical computer science 7: 1075:Quantum information science 242:Quantum information science 10: 1536: 1496:List of complexity classes 470:quantum gate teleportation 152: 56:by removing references to 1520:Quantum complexity theory 1493: 1452: 1416: 1360: 1253: 1133: 1065: 1008: 971: 937: 914: 881: 872: 805: 734: 672: 632: 599:Quantum Fourier transform 544: 495:Post-quantum cryptography 438:Entanglement distillation 411: 320: 248: 120:. This is in contrast to 1485:Interactive proof system 1085:Quantum mechanics topics 780:Quantum machine learning 756:One-way quantum computer 609:Quantum phase estimation 510:Quantum key distribution 443:Monogamy of entanglement 112:that can be solved by a 692:Randomized benchmarking 554:Amplitude amplification 1439:Arithmetical hierarchy 792:Quantum Turing machine 785:quantum neural network 532:Quantum secret sharing 170:–related article is a 47:user-generated content 1434:Grzegorczyk hierarchy 1429:Exponential hierarchy 1361:Considered infeasible 864:Entanglement-assisted 825:quantum convolutional 500:Quantum coin flipping 465:Quantum teleportation 426:entanglement-assisted 256:DiVincenzo's criteria 1424:Polynomial hierarchy 1254:Suspected infeasible 675:processor benchmarks 604:Quantum optimization 487:Quantum cryptography 298:physical vs. logical 62:used inappropriately 1453:Families of classes 1134:Considered feasible 388:Quantum speed limit 283:Quantum programming 278:Quantum information 132:algebraic numbers. 1127:Complexity classes 1037:Forest/Rigetti QCS 773:quantum logic gate 559:Bernstein–Vazirani 546:Quantum algorithms 421:Classical capacity 305:Quantum processors 288:Quantum simulation 108:) is the class of 58:unreliable sources 1502: 1501: 1444:Boolean hierarchy 1417:Class hierarchies 1093: 1092: 1004: 1003: 901:Linear optical QC 682:Quantum supremacy 636:complexity theory 589:Quantum annealing 540: 539: 477:Superdense coding 266:Quantum computing 183: 182: 110:decision problems 90: 89: 82: 60:, where they are 16:(Redirected from 1527: 1120: 1113: 1106: 1097: 1096: 1083: 1082: 1073: 1072: 879: 878: 809:error correction 738:computing models 704:Relaxation times 594:Quantum counting 483: 482: 431:quantum capacity 378:No-teleportation 363:No-communication 235: 228: 221: 212: 211: 204: 197: 190: 159:P â‰ź NP 154: 124:, where quantum 114:quantum computer 85: 78: 74: 71: 65: 38: 37: 30: 27:Computer science 21: 18:EQP (complexity) 1535: 1534: 1530: 1529: 1528: 1526: 1525: 1524: 1505: 1504: 1503: 1498: 1489: 1448: 1412: 1356: 1350:PSPACE-complete 1249: 1129: 1124: 1094: 1089: 1061: 1011: 1000: 973:Superconducting 967: 933: 924:Neutral atom QC 916:Ultracold atoms 910: 875:implementations 874: 868: 808: 801: 768:Quantum circuit 736: 730: 724: 714: 674: 668: 635: 628: 584:Hidden subgroup 536: 525:other protocols 481: 458:quantum network 453:Quantum channel 413: 407: 353:No-broadcasting 343:Gottesman–Knill 316: 244: 239: 209: 208: 161: 138: 86: 75: 69: 66: 51: 39: 35: 28: 23: 22: 15: 12: 11: 5: 1533: 1523: 1522: 1517: 1500: 1499: 1494: 1491: 1490: 1488: 1487: 1482: 1477: 1472: 1467: 1462: 1456: 1454: 1450: 1449: 1447: 1446: 1441: 1436: 1431: 1426: 1420: 1418: 1414: 1413: 1411: 1410: 1405: 1400: 1395: 1390: 1385: 1380: 1375: 1370: 1364: 1362: 1358: 1357: 1355: 1354: 1353: 1352: 1342: 1337: 1336: 1335: 1325: 1320: 1315: 1310: 1305: 1300: 1295: 1290: 1289: 1288: 1286:co-NP-complete 1283: 1278: 1273: 1263: 1257: 1255: 1251: 1250: 1248: 1247: 1242: 1237: 1232: 1227: 1222: 1217: 1216: 1215: 1205: 1200: 1195: 1190: 1189: 1188: 1178: 1173: 1168: 1163: 1158: 1153: 1148: 1143: 1137: 1135: 1131: 1130: 1123: 1122: 1115: 1108: 1100: 1091: 1090: 1088: 1087: 1077: 1066: 1063: 1062: 1060: 1059: 1057:many others... 1054: 1049: 1044: 1039: 1030: 1016: 1014: 1006: 1005: 1002: 1001: 999: 998: 993: 988: 983: 977: 975: 969: 968: 966: 965: 960: 955: 950: 944: 942: 935: 934: 932: 931: 929:Trapped-ion QC 926: 920: 918: 912: 911: 909: 908: 903: 898: 893: 887: 885: 883:Quantum optics 876: 870: 869: 867: 866: 861: 860: 859: 852: 847: 842: 837: 832: 827: 822: 813: 811: 803: 802: 800: 799: 794: 789: 788: 787: 777: 776: 775: 765: 764: 763: 753: 748: 742: 740: 732: 731: 729: 728: 727: 726: 722: 716: 712: 701: 700: 699: 689: 687:Quantum volume 684: 678: 676: 670: 669: 667: 666: 661: 656: 651: 646: 640: 638: 630: 629: 627: 626: 621: 616: 611: 606: 601: 596: 591: 586: 581: 576: 571: 566: 564:Boson sampling 561: 556: 550: 548: 542: 541: 538: 537: 535: 534: 529: 528: 527: 522: 517: 507: 502: 497: 491: 489: 480: 479: 474: 473: 472: 462: 461: 460: 450: 445: 440: 435: 434: 433: 428: 417: 415: 409: 408: 406: 405: 400: 398:Solovay–Kitaev 395: 390: 385: 380: 375: 370: 365: 360: 355: 350: 345: 340: 335: 330: 324: 322: 318: 317: 315: 314: 313: 312: 302: 301: 300: 290: 285: 280: 275: 274: 273: 263: 258: 252: 250: 246: 245: 238: 237: 230: 223: 215: 207: 206: 199: 192: 184: 181: 180: 163: 157: 151: 150: 143:Complexity Zoo 137: 134: 88: 87: 42: 40: 33: 26: 9: 6: 4: 3: 2: 1532: 1521: 1518: 1516: 1513: 1512: 1510: 1497: 1492: 1486: 1483: 1481: 1478: 1476: 1473: 1471: 1468: 1466: 1463: 1461: 1458: 1457: 1455: 1451: 1445: 1442: 1440: 1437: 1435: 1432: 1430: 1427: 1425: 1422: 1421: 1419: 1415: 1409: 1406: 1404: 1401: 1399: 1396: 1394: 1391: 1389: 1386: 1384: 1381: 1379: 1376: 1374: 1371: 1369: 1366: 1365: 1363: 1359: 1351: 1348: 1347: 1346: 1343: 1341: 1338: 1334: 1331: 1330: 1329: 1326: 1324: 1321: 1319: 1316: 1314: 1311: 1309: 1306: 1304: 1301: 1299: 1296: 1294: 1291: 1287: 1284: 1282: 1279: 1277: 1274: 1272: 1269: 1268: 1267: 1264: 1262: 1259: 1258: 1256: 1252: 1246: 1243: 1241: 1238: 1236: 1233: 1231: 1228: 1226: 1223: 1221: 1218: 1214: 1211: 1210: 1209: 1206: 1204: 1201: 1199: 1196: 1194: 1191: 1187: 1184: 1183: 1182: 1179: 1177: 1174: 1172: 1169: 1167: 1164: 1162: 1159: 1157: 1154: 1152: 1149: 1147: 1144: 1142: 1139: 1138: 1136: 1132: 1128: 1121: 1116: 1114: 1109: 1107: 1102: 1101: 1098: 1086: 1078: 1076: 1068: 1067: 1064: 1058: 1055: 1053: 1050: 1048: 1045: 1043: 1040: 1038: 1034: 1031: 1029: 1025: 1021: 1018: 1017: 1015: 1013: 1007: 997: 994: 992: 989: 987: 984: 982: 979: 978: 976: 974: 970: 964: 961: 959: 956: 954: 953:Spin qubit QC 951: 949: 946: 945: 943: 940: 936: 930: 927: 925: 922: 921: 919: 917: 913: 907: 904: 902: 899: 897: 894: 892: 889: 888: 886: 884: 880: 877: 871: 865: 862: 858: 857: 853: 851: 848: 846: 843: 841: 838: 836: 833: 831: 828: 826: 823: 821: 818: 817: 815: 814: 812: 810: 804: 798: 795: 793: 790: 786: 783: 782: 781: 778: 774: 771: 770: 769: 766: 762: 761:cluster state 759: 758: 757: 754: 752: 749: 747: 744: 743: 741: 739: 733: 725: 721: 717: 715: 711: 707: 706: 705: 702: 698: 695: 694: 693: 690: 688: 685: 683: 680: 679: 677: 671: 665: 662: 660: 657: 655: 652: 650: 647: 645: 642: 641: 639: 637: 631: 625: 622: 620: 617: 615: 612: 610: 607: 605: 602: 600: 597: 595: 592: 590: 587: 585: 582: 580: 577: 575: 572: 570: 569:Deutsch–Jozsa 567: 565: 562: 560: 557: 555: 552: 551: 549: 547: 543: 533: 530: 526: 523: 521: 518: 516: 513: 512: 511: 508: 506: 505:Quantum money 503: 501: 498: 496: 493: 492: 490: 488: 484: 478: 475: 471: 468: 467: 466: 463: 459: 456: 455: 454: 451: 449: 446: 444: 441: 439: 436: 432: 429: 427: 424: 423: 422: 419: 418: 416: 414:communication 410: 404: 401: 399: 396: 394: 391: 389: 386: 384: 381: 379: 376: 374: 371: 369: 366: 364: 361: 359: 356: 354: 351: 349: 346: 344: 341: 339: 336: 334: 331: 329: 326: 325: 323: 319: 311: 308: 307: 306: 303: 299: 296: 295: 294: 291: 289: 286: 284: 281: 279: 276: 272: 269: 268: 267: 264: 262: 259: 257: 254: 253: 251: 247: 243: 236: 231: 229: 224: 222: 217: 216: 213: 205: 200: 198: 193: 191: 186: 185: 179: 177: 173: 169: 164: 160: 156: 155: 149: 145: 144: 140: 139: 133: 129: 127: 123: 119: 115: 111: 107: 104:or sometimes 103: 99: 95: 84: 81: 73: 70:February 2023 63: 59: 55: 49: 48: 43:This article 41: 32: 31: 19: 981:Charge qubit 906:KLM protocol 855: 719: 709: 648: 403:Purification 333:Eastin–Knill 176:expanding it 165: 158: 141: 130: 105: 101: 97: 91: 76: 67: 52:Please help 44: 1333:#P-complete 1271:NP-complete 1186:NL-complete 1012:programming 991:Phase qubit 896:Circuit QED 368:No-deleting 310:cloud-based 1509:Categories 1388:ELEMENTARY 1213:P-complete 1052:libquantum 986:Flux qubit 891:Cavity QED 840:Bacon–Shor 830:stabilizer 358:No-cloning 136:References 126:algorithms 54:improve it 1383:2-EXPTIME 958:NV center 393:Threshold 373:No-hiding 338:Gleason's 1378:EXPSPACE 1373:NEXPTIME 1141:DLOGTIME 1020:OpenQASM 996:Transmon 873:Physical 673:Quantum 574:Grover's 348:Holevo's 321:Theorems 271:timeline 261:NISQ era 1368:EXPTIME 1276:NP-hard 1010:Quantum 948:Kane QC 807:Quantum 735:Quantum 664:PostBQP 634:Quantum 619:Simon's 412:Quantum 249:General 1475:NSPACE 1470:DSPACE 1345:PSPACE 1028:IBM QX 1024:Qiskit 963:NMR QC 941:-based 845:Steane 816:Codes 614:Shor's 520:SARG04 328:Bell's 162:  1465:NTIME 1460:DTIME 1281:co-NP 850:Toric 293:Qubit 166:This 1293:TFNP 1042:Cirq 1033:Quil 939:Spin 835:Shor 515:BB84 448:LOCC 172:stub 1408:ALL 1308:QMA 1298:FNP 1240:APX 1235:BQP 1230:BPP 1220:ZPP 1151:ACC 856:gnu 820:CSS 697:XEB 659:QMA 654:QIP 649:EQP 644:BQP 624:VQE 579:HHL 383:PBR 148:EQP 102:EQP 92:In 1511:: 1403:RE 1393:PR 1340:IP 1328:#P 1323:PP 1318:⊕P 1313:PH 1303:AM 1266:NP 1261:UP 1245:FP 1225:RP 1203:CC 1198:SC 1193:NC 1181:NL 1176:FL 1171:RL 1166:SL 1156:TC 1146:AC 1047:Q# 146:: 106:QP 96:, 1398:R 1208:P 1161:L 1119:e 1112:t 1105:v 1035:– 1026:– 1022:– 723:2 720:T 713:1 710:T 234:e 227:t 220:v 203:e 196:t 189:v 178:. 118:P 100:( 83:) 77:( 72:) 68:( 64:. 50:. 20:)

Index

EQP (complexity)
user-generated content
improve it
unreliable sources
used inappropriately
Learn how and when to remove this message
computational complexity theory
decision problems
quantum computer
P
bounded-error quantum computing
algorithms
Complexity Zoo
EQP
theoretical computer science
stub
expanding it
v
t
e
v
t
e
Quantum information science
DiVincenzo's criteria
NISQ era
Quantum computing
timeline
Quantum information
Quantum programming

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑