Poster Presentations

Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
Quantum Information Processing, 2002 - The Fifth Workshop on Quantum Information Processing, IBM T.J. Watson Research Center, Yorktown Heights, New York, January, 14-17, 2002

Simulating Arbitrary Pair-Interactions by a Given Hamiltonian: Graph-Theoretical Bounds on the Time Complexity
Quantum Information: Theory, Experiment and Perspectives, Gdansk, Poland, July, 10-18, 2001

Performances of Binary Block Codes Used on Classical-Quantum Channels
The Fifth International Conference on Quantum Communication, Measurement & Computing, Capri, Italy, 2000


Back to main page