1 code implementation • 16 Dec 2020 • M. Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, Patrick J. Coles
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost.
1 code implementation • 31 Aug 2020 • Bálint Koczor, Simon C. Benjamin
Variational algorithms have particular relevance for near-term quantum computers but require non-trivial parameter optimisations.
Quantum Physics
no code implementations • 26 May 2020 • Carlos Outeiral, Martin Strahm, Jiye Shi, Garrett M. Morris, Simon C. Benjamin, Charlotte M. Deane
Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts.
1 code implementation • 23 Aug 2019 • Bálint Koczor, Suguru Endo, Tyson Jones, Yuichiro Matsuzaki, Simon C. Benjamin
We present a novel approach for finding (near) optimal states for metrology in the presence of noise, using variational techniques as a tool for efficiently searching the classically intractable high-dimensional space of quantum states.
Quantum Physics
no code implementations • 4 Dec 2018 • Xiaosi Xu, Qi Zhao, Xiao Yuan, Simon C. Benjamin
We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code.
Quantum Physics
2 code implementations • 7 Nov 2018 • Tyson Jones, Simon C. Benjamin
We explore a method for automatically recompiling a quantum circuit A into a target circuit B, with the goal that both circuits have the same action on a specific input i. e. B|in> = A|in>.
Quantum Physics