Timothy J. Proctor
Hybrid quantum computing with ancillas
Proctor, Timothy J.; Kendon, Viv
Abstract
In the quest to build a practical quantum computer, it is important to use efficient schemes for enacting the elementary quantum operations from which quantum computer programs are constructed. The opposing requirements of well-protected quantum data and fast quantum operations must be balanced to maintain the integrity of the quantum information throughout the computation. One important approach to quantum operations is to use an extra quantum system – an ancilla – to interact with the quantum data register. Ancillas can mediate interactions between separated quantum registers, and by using fresh ancillas for each quantum operation, data integrity can be preserved for longer. This review provides an overview of the basic concepts of the gate model quantum computer architecture, including the different possible forms of information encodings – from base two up to continuous variables – and a more detailed description of how the main types of ancilla-mediated quantum operations provide efficient quantum gates.
Citation
Proctor, T. J., & Kendon, V. (2016). Hybrid quantum computing with ancillas. Contemporary Physics, 57(4), 459-476. https://doi.org/10.1080/00107514.2016.1152700
Journal Article Type | Article |
---|---|
Acceptance Date | Feb 8, 2016 |
Online Publication Date | Mar 15, 2016 |
Publication Date | Mar 15, 2016 |
Deposit Date | Jul 23, 2018 |
Publicly Available Date | Jul 23, 2018 |
Journal | Contemporary Physics |
Print ISSN | 0010-7514 |
Electronic ISSN | 1366-5812 |
Publisher | Taylor and Francis Group |
Peer Reviewed | Peer Reviewed |
Volume | 57 |
Issue | 4 |
Pages | 459-476 |
DOI | https://doi.org/10.1080/00107514.2016.1152700 |
Public URL | https://durham-repository.worktribe.com/output/1325555 |
Files
Accepted Journal Article
(1.8 Mb)
PDF
Copyright Statement
This is an Accepted Manuscript of an article published by Taylor & Francis in Contemporary physics on 15 March 2016, available online: http://www.tandfonline.com/10.1080/00107514.2016.1152700
You might also like
Quantum algorithms for scientific computing.
(2024)
Journal Article
Cycle discrete-time quantum walks on a noisy quantum computer
(2024)
Journal Article
Using copies can improve precision in continuous-time quantum computing
(2023)
Journal Article
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
(2023)
Journal Article
Experimental test of search range in quantum annealing
(2021)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search