Knowledge (XXG)

Postselection

Source ๐Ÿ“

511: 245: 307:
Some quantum experiments use post-selection after the experiment as a replacement for communication during the experiment, by post-selecting the communicated value into a constant.
147: 277: 102: 495: 70: 50: 586: 552: 159: 576: 581: 488: 325: 153: 571: 545: 481: 461: 395:
Hensen; et al. (2015). "Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres".
591: 538: 371: 105: 25: 287: 110: 414: 344: 250: 75: 404: 334: 17: 323:
Aaronson, Scott (2005). "Quantum computing, postselection, and probabilistic polynomial-time".
430: 29: 522: 465: 422: 352: 300: 418: 348: 291: 55: 35: 565: 240:{\textstyle \operatorname {Pr} ={\frac {\operatorname {Pr} }{\operatorname {Pr} }}} 32:
upon the occurrence of a given event. In symbols, once we postselect for an event
518: 510: 286:, a complexity class defined with postselection. Using postselection it seems 434: 356: 339: 426: 279:
be strictly positive in order for the postselection to be well-defined.
283: 409: 526: 469: 253: 162: 78: 113: 58: 38: 271: 239: 141: 96: 64: 44: 546: 489: 8: 553: 539: 496: 482: 408: 338: 252: 210: 206: 191: 181: 176: 175: 161: 132: 127: 126: 112: 77: 57: 37: 315: 52:, the probability of some other event 7: 507: 505: 449: 447: 142:{\displaystyle \operatorname {Pr} } 587:Theoretical computer science stubs 525:. You can help Knowledge (XXG) by 468:. You can help Knowledge (XXG) by 372:"Complexity Class of the Week: PP" 326:Proceedings of the Royal Society A 14: 509: 272:{\textstyle \operatorname {Pr} } 97:{\textstyle \operatorname {Pr} } 376:Computational Complexity Weblog 370:Aaronson, Scott (2004-01-11). 266: 260: 231: 225: 214: 200: 185: 177: 169: 136: 128: 120: 91: 85: 1: 577:Theoretical computer science 462:theoretical computer science 247:, and thus we require that 608: 504: 446: 154:discrete probability space 582:Quantum complexity theory 290:are much more powerful: 572:Conditional probability 288:quantum Turing machines 106:conditional probability 521:-related article is a 464:โ€“related article is a 357:10.1098/rspa.2005.1546 273: 241: 143: 98: 66: 46: 274: 242: 144: 99: 67: 47: 251: 160: 111: 76: 56: 36: 427:10.1038/nature15759 419:2015Natur.526..682H 349:2005RSPSA.461.3473A 333:(2063): 3473โ€“3482. 269: 237: 139: 94: 62: 42: 18:probability theory 592:Probability stubs 534: 533: 477: 476: 403:(7575): 682โ€“686. 235: 65:{\displaystyle F} 45:{\displaystyle E} 30:probability space 599: 555: 548: 541: 513: 506: 498: 491: 484: 453:P โ‰Ÿ NP 448: 439: 438: 412: 392: 386: 385: 383: 382: 367: 361: 360: 342: 340:quant-ph/0412187 320: 278: 276: 275: 270: 246: 244: 243: 238: 236: 234: 217: 192: 180: 148: 146: 145: 140: 131: 103: 101: 100: 95: 71: 69: 68: 63: 51: 49: 48: 43: 607: 606: 602: 601: 600: 598: 597: 596: 562: 561: 560: 559: 503: 502: 455: 444: 442: 394: 393: 389: 380: 378: 369: 368: 364: 322: 321: 317: 313: 249: 248: 218: 193: 158: 157: 109: 108: 74: 73: 54: 53: 34: 33: 12: 11: 5: 605: 603: 595: 594: 589: 584: 579: 574: 564: 563: 558: 557: 550: 543: 535: 532: 531: 514: 501: 500: 493: 486: 478: 475: 474: 457: 451: 441: 440: 387: 362: 314: 312: 309: 292:Scott Aaronson 268: 265: 262: 259: 256: 233: 230: 227: 224: 221: 216: 213: 209: 205: 202: 199: 196: 190: 187: 184: 179: 174: 171: 168: 165: 138: 135: 130: 125: 122: 119: 116: 93: 90: 87: 84: 81: 61: 41: 13: 10: 9: 6: 4: 3: 2: 604: 593: 590: 588: 585: 583: 580: 578: 575: 573: 570: 569: 567: 556: 551: 549: 544: 542: 537: 536: 530: 528: 524: 520: 515: 512: 508: 499: 494: 492: 487: 485: 480: 479: 473: 471: 467: 463: 458: 454: 450: 445: 436: 432: 428: 424: 420: 416: 411: 406: 402: 398: 391: 388: 377: 373: 366: 363: 358: 354: 350: 346: 341: 336: 332: 328: 327: 319: 316: 310: 308: 305: 303: 302: 297: 293: 289: 285: 280: 263: 257: 254: 228: 222: 219: 211: 207: 203: 197: 194: 188: 182: 172: 166: 163: 155: 150: 133: 123: 117: 114: 107: 88: 82: 79: 72:changes from 59: 39: 31: 27: 23: 19: 527:expanding it 516: 470:expanding it 459: 452: 443: 400: 396: 390: 379:. Retrieved 375: 365: 330: 324: 318: 306: 299: 298:is equal to 295: 281: 151: 21: 15: 519:probability 566:Categories 410:1508.05949 381:2008-05-02 311:References 22:postselect 282:See also 258:⁡ 223:⁡ 208:∩ 198:⁡ 167:⁡ 118:⁡ 83:⁡ 26:condition 435:26503041 415:Bibcode 345:Bibcode 296:PostBQP 294:proved 284:PostBQP 104:to the 456:  433:  397:Nature 152:For a 24:is to 517:This 460:This 405:arXiv 335:arXiv 20:, to 523:stub 466:stub 431:PMID 423:doi 401:526 353:doi 331:461 16:In 568:: 429:. 421:. 413:. 399:. 374:. 351:. 343:. 329:. 304:. 301:PP 255:Pr 220:Pr 195:Pr 164:Pr 156:, 149:. 115:Pr 80:Pr 28:a 554:e 547:t 540:v 529:. 497:e 490:t 483:v 472:. 437:. 425:: 417:: 407:: 384:. 359:. 355:: 347:: 337:: 267:] 264:E 261:[ 232:] 229:E 226:[ 215:] 212:E 204:F 201:[ 189:= 186:] 183:E 178:| 173:F 170:[ 137:] 134:E 129:| 124:F 121:[ 92:] 89:F 86:[ 60:F 40:E

Index

probability theory
condition
probability space
conditional probability
discrete probability space
PostBQP
quantum Turing machines
Scott Aaronson
PP
Proceedings of the Royal Society A
arXiv
quant-ph/0412187
Bibcode
2005RSPSA.461.3473A
doi
10.1098/rspa.2005.1546
"Complexity Class of the Week: PP"
arXiv
1508.05949
Bibcode
2015Natur.526..682H
doi
10.1038/nature15759
PMID
26503041
theoretical computer science
stub
expanding it
v
t

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

โ†‘