Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Michael J Bremner

Showing results (1-10 of 3) with videos related to

Pageof 1
Sort By:
Physical Review Letters|June 13, 2009
Are random pure States useful for quantum computation?Michael J Bremner, Caterina Mora, Andreas Winter
Physical Review Letters|September 3, 2016
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum ComputationsMichael J Bremner, Ashley Montanaro, Dan J Shepherd
Physical Review Letters|December 18, 2002
Practical scheme for quantum computation with any two-qubit entangling gateMichael J Bremner, Christopher M Dawson, Jennifer L Dodd, et al.
Pageof 1

Showing results (1-10 of 3) with videos related to

Sort By:
Pageof 1
Physical Review Letters|June 13, 2009
Are random pure States useful for quantum computation?Michael J Bremner, Caterina Mora, Andreas Winter
Physical Review Letters|September 3, 2016
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum ComputationsMichael J Bremner, Ashley Montanaro, Dan J Shepherd
Physical Review Letters|December 18, 2002
Practical scheme for quantum computation with any two-qubit entangling gateMichael J Bremner, Christopher M Dawson, Jennifer L Dodd, et al.
Pageof 1