Primary area of research interest is computational complexity theory.
Currently I am working on quantum circuit complexity. I am specifically interested in
investigating the power of low depth quantum circuits.
Other areas of
interest are information theory, cryptography and information security. Outside
of computer science, I like combinatorics and algebra (no linear algebra or geometry
I always believed that computer science is about systematically analysing
a problem and so it ought to be used by any one dealing with any kind
of computation. Lately, we are seeing application of computer science, specially complexity
theory, which is about analysing the hardness of a problem, in various fields like bio-computing,
economics, management, chemistry etc. I am quite excited about such applications of Computer
Science to diverse fields.
My Erdos number is 4.
Reports and Publications
- D.Bera, F. Green, S. Homer. Small depth quantum circuits ACM SIGACT News article, 38(2), June 2007
- D.Bera, S. Fenner, F. Green, S. Homer. Efficient universal quantum circuits in Quantum Information and Computation, 10(1&2), 2010.
- Preliminary version in D.Bera, S. Fenner, F. Green, S. Homer. Efficient universal quantum circuits COCOON 2009
- D. Bera. A lower bound method for quantum circuits Information Processing Letters, 111(15), 2011
- D. Bera, S. Homer. On Finding Sensitivity of Quantum and Classical Gates BUCS Tech Report 2009-019
- D. Bera. Quantum Circuits: Power and Limitations Ph.D. Dissertation
- F. Esposito, I. Matta, D. Bera, P. Michiardi. On the impact of seed scheduling in peer-to-peer networks in Computer Networks 55(15), 2011.
- A. Saxena, M. Pundir, V. Goyal, D. Bera. Preserving Location Privacy for Continuous Queries on Known Route in Proceedings of ICISS 2011