Parallelising Matrix Operations on Clusters for an Optimal Control-Based Quantum Compiler

This publication has 29 references indexed in Scilit:

• Optimal control-based efficient synthesis of building blocks of quantum algorithms: A perspective from network complexity towards time complexity
  Physical Review A, 2005
• Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms
  Journal of Magnetic Resonance, 2005
• The quantum query complexity of the hidden subgroup problem is polynomial
  Information Processing Letters, 2004
• Quantum technology: the second quantum revolution
  Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2003
• Algorithms for quantum computation: discrete logarithms and factoring
  2002
• Quantum algorithms revisited
  Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
• Quantum algorithms and the Fourier transform
  Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  SIAM Journal on Computing, 1997
• Quantum theory, the Church–Turing principle and the universal quantum computer
  Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985
• Simulating physics with computers
  International Journal of Theoretical Physics, 1982