Sciweavers

164 search results - page 20 / 33
» The Learnability of Quantum States
Sort
View
TIT
2008
105views more  TIT 2008»
14 years 10 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 5 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
IPPS
2006
IEEE
15 years 5 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed
83
Voted
CORR
2010
Springer
137views Education» more  CORR 2010»
14 years 10 months ago
Quantum interactive proofs with short messages
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
Salman Beigi, Peter W. Shor, John Watrous
ESANN
2007
15 years 1 months ago
Several ways to solve the MSO problem
The so called MSO-problem, – a simple superposition of two or more sinusoidal waves –, has recently been discussed as a benchmark problem for reservoir computing and was shown ...
Jochen J. Steil