scholarly journals High-fidelity linear optical quantum computing with polarization encoding

2006 ◽  
Vol 73 (1) ◽  
Author(s):  
Federico M. Spedalieri ◽  
Hwang Lee ◽  
Jonathan P. Dowling
2005 ◽  
Author(s):  
Federico Spedalieri ◽  
Hwang Lee ◽  
Jonathan Dowling

Author(s):  
Scott Aaronson

One of the crown jewels of complexity theory is Valiant's theorem that computing the permanent of an n × n matrix is # P -hard. Here we show that, by using the model of linear-optical quantum computing —and in particular, a universality theorem owing to Knill, Laflamme and Milburn—one can give a different and arguably more intuitive proof of this theorem.


2018 ◽  
Author(s):  
B. Villa ◽  
J. Lee ◽  
A. Bennett ◽  
M. Stevenson ◽  
D. Ellis ◽  
...  

2009 ◽  
Vol 103 (24) ◽  
Author(s):  
D. N. Biggerstaff ◽  
R. Kaltenbaek ◽  
D. R. Hamel ◽  
G. Weihs ◽  
T. Rudolph ◽  
...  

2007 ◽  
Vol 76 (4) ◽  
Author(s):  
L. Aolita ◽  
K. Kim ◽  
J. Benhelm ◽  
C. F. Roos ◽  
H. Häffner

2010 ◽  
Vol 82 (2) ◽  
Author(s):  
A. J. F. Hayes ◽  
H. L. Haselgrove ◽  
Alexei Gilchrist ◽  
T. C. Ralph

2013 ◽  
Vol 111 (15) ◽  
Author(s):  
Peter C. Humphreys ◽  
Benjamin J. Metcalf ◽  
Justin B. Spring ◽  
Merritt Moore ◽  
Xian-Min Jin ◽  
...  

2007 ◽  
Vol 9 (6) ◽  
pp. 203-203 ◽  
Author(s):  
Michael Varnava ◽  
Daniel E Browne ◽  
Terry Rudolph

Sign in / Sign up

Export Citation Format

Share Document