Timothy J. Proctor
Minimal ancilla mediated quantum computation
Proctor, Timothy J.; Kendon, Viv
Abstract
Schemes of universal quantum computation in which the interactions between the computational elements, in a computational register, are mediated by some ancillary system are of interest due to their relevance to the physical implementation of a quantum computer. Furthermore, reducing the level of control required over both the ancillary and register systems has the potential to simplify any experimental implementation. In this paper we consider how to minimise the control needed to implement universal quantum computation in an ancilla-mediated fashion. Considering computational schemes which require no measurements and hence evolve by unitary dynamics for the global system, we show that when employing an ancilla qubit there are certain fixed-time ancilla-register interactions which, along with ancilla initialisation in the computational basis, are universal for quantum computation with no additional control of either the ancilla or the register. We develop two distinct models based on locally inequivalent interactions and we then discuss the relationship between these unitary models and the measurement-based ancilla-mediated models known as ancilla-driven quantum computation.
Citation
Proctor, T. J., & Kendon, V. (2014). Minimal ancilla mediated quantum computation. EPJ Quantum Technology, 1(1), Article 13. https://doi.org/10.1140/epjqt13
Journal Article Type | Article |
---|---|
Acceptance Date | Aug 13, 2014 |
Online Publication Date | Sep 4, 2014 |
Publication Date | Sep 4, 2014 |
Deposit Date | Nov 5, 2014 |
Publicly Available Date | Sep 4, 2015 |
Journal | EPJ Quantum Technology |
Electronic ISSN | 2196-0763 |
Publisher | SpringerOpen |
Peer Reviewed | Peer Reviewed |
Volume | 1 |
Issue | 1 |
Article Number | 13 |
DOI | https://doi.org/10.1140/epjqt13 |
Keywords | Ancilla, Universal gates, Minimal control, Quantum computation, Quantum bus, Ancilla-driven, Ancilla-controlled. |
Public URL | https://durham-repository.worktribe.com/output/1418059 |
Related Public URLs | http://arxiv.org/pdf/1404.2527 |
Files
Published Journal Article
(380 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
© 2014 Proctor and Kendon; licensee Springer on behalf of EPJ
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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