|
Quantum algorithms and
complexity theory
- New
quantum algorithms for element distinctness as well as for testing
group commutativity using quantum walk
paradigm
- Efficiency
improvements in quantum algorithms for simulating the evolution of
sparse Hamiltonian systems
- Multiprover interactive proof systems shown to
be weaker in the presence of quantum entanglement
- A stronger version of the adversary lower bound method to make use of the stronger condition that any algorithm actually computes the function
- Several interactive proof systems are zero-knowledge against general quantum attacks
Quantum communication and
information security
- Development
of “decoy state” paradigm for improved efficiency in quantum key
distribution
- Generalization
of data hiding to the multi-party setting
- Bit
commitment shown possible in a “multi-prover”
setting
Theory of quantum
information implementations
- New
methodologies for quantum error correction
- Efficiency
improvements in measurement-based models of computation
- Development
of theoretical framework for enhanced single photon detection via interferometry
- Direct experimental measurement of certain key properties of decoherence based on symmetrization
Quantum information theory and
entanglement theory
- Nonconstant lower bound on the number of copies
of a state required for entanglement distillation
- Efficiency
improvements for communicating classical bits, quantum bits, and
entanglement via “measurement concentration” effects
- Efficiency
improvements in pseudo-random generation of unitary operations
- Discovery of counterexamples to the p-norm multiplicativity conjecture
- Quantum information theory and the problem of black holes as mirrors
|
