515 search results - page 57 / 103 » Classically-controlled Quantum Computation |
FUIN
2008
14 years 9 months ago
2008
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary ...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
FCT
2001
Springer
15 years 2 months ago
2001
Springer
