Profile
Outputs
| Title | Category | Date | Authors |
| Differential evolution for many-particle adaptive quantum metrology University of Calgary | Publication | 2013-01-01 | N. Lovett, C. Crosnier, M. Perarnau-Llobet, B. C. Sanders | | Generation of topologically useful entangled states University of Calgary | Publication | 2011-01-01 | N. Lovett, B. T. Varcoe | | An enhanced machine learning algorithm for precise adaptive phase estimationSequential adaptive measurement is a promising strategy for quantum-enhanced single-shot measurements, but appropriate adaptive procedures are difficult to devise even for ideal cases. Machine learning techniques enable suitable procedures to be found, but these machine learning methods are severely limited by computational time and space restrictions. Thus far the collective intelligence algorithm known as particle swarm optimization has been used to beat the best previous results (obtained by clever guessing) for adaptive phase measurement in quantum interferometry with an input state of an entangled multi-photon pulse. Specifically, particle swarm optimisation has successfully devised procedures with a space cost that is linear in the number N of operations on the multi-photon pulse and a time that scales as N6 [1, 2]. The resultant procedure delivers a power-law scaling for the interferometric phase uncertainty,\\r\\n∆¦Õ vs N, but this power law scaling breaks suddenly at an input N ¡Ö 50 due to a failure of the technique for specific computational resources, namely the number of particles (particle swarm optimisation candidate solutions) and number of iterations. We devise a far superior algorithm that is able to deliver much better precision for given N with the restriction of using the same computational resources as the competing algorithm. We show that the differential evolution approach to machine learning delivers this same power law scaling as particle swarm optimisation and shows no sign of breakdown up to one hundred photons. As the true cost scales as N6, this doubling (at least) of the number of photons actually corresponds to a 64 fold increase in the efficiency of devising the algorithm. University of Calgary | Presentation | 2012-12-17 | N. Lovett, B. C. Sanders | | Learning algorithms for designing efficient, precise, robust, single-shot, quantum-enhanced adaptive parameter estimation policiesSequential adaptive measurement is a promising strategy for quantum-enhanced single-shot measurements, but appropriate adaptive procedures are difficult to devise even for ideal cases. Machine-learning techniques enable suitable adaptive policies to be found, but these machine-learning methods are severely limited by computational time and space restrictions. Thus far the collective-intelligence algorithm known as particle swarm optimization has been used to beat the best previous results (obtained by clever guessing) for single-shot adaptive quantum-enhanced measurements of interferometric phase measurement with an entangled multi-photon pulse input state. Specifically, particle swarm optimization previously yielded policies with a space cost that is linear in the number N of operations on the multi-photon pulse and a time that scales as N6 [1-3].
The resultant policy delivers a power-law scaling for the interferometric phase uncertainty phase, ∆φ vs N, but this power law scaling breaks suddenly at N~50 due to a failure of the technique for specific computational resources, namely the number of particles (particle swarm optimization candidate solutions) and number of iterations. Here we devise a far superior algorithm that is able to deliver much better precision for given N with the restriction of using the same computational resources as the competing algorithm. We show that the differential evolution approach to machine learning delivers this same power law scaling as particle swarm optimization and shows no sign of breakdown up to N=100 photons. As the true cost scales as N6, this doubling (at least) of the number of photons actually corresponds to a 64-fold increase in the efficiency of devising the algorithm.
University of Calgary | Presentation | 2013-02-26 | C. Crosnier, N. Lovett, B. C. Sanders | | Towards path optimization in an optically switched quantum network University of Calgary, The University of Calgary | Presentation | 2011-11-04 | I. Lucio Martinez, P. Chan, N. Lovett, X. Mo, W. Tittel | | Analogue Computation with Microwaves University of Calgary | Publication | 2010-01-01 | V. Kendon, M. Everitt, M. L. Jones, N. Lovett, R. C. Wagner |
| |
