Timothy J. Proctor
Quantum computation mediated by ancillary qudits and spin coherent states
Proctor, Timothy J.; Dooley, Shane; Kendon, Viv
Abstract
Models of universal quantum computation in which the required interactions between register (computational) qubits are mediated by some ancillary system are highly relevant to experimental realizations of a quantum computer. We introduce such a universal model that employs a d -dimensional ancillary qudit. The ancilla-register interactions take the form of controlled displacements operators, with a displacement operator defined on the periodic and discrete lattice phase space of a qudit. We show that these interactions can implement controlled phase gates on the register by utilizing geometric phases that are created when closed loops are traversed in this phase space. The extra degrees of freedom of the ancilla can be harnessed to reduce the number of operations required for certain gate sequences. In particular, we see that the computational advantages of the quantum bus (qubus) architecture, which employs a field-mode ancilla, are also applicable to this model. We then explore an alternative ancilla-mediated model which employs a spin ensemble as the ancillary system and again the interactions with the register qubits are via controlled displacement operators, with a displacement operator defined on the Bloch sphere phase space of the spin coherent states of the ensemble. We discuss the computational advantages of this model and its relationship with the qubus architecture.
Citation
Proctor, T. J., Dooley, S., & Kendon, V. (2015). Quantum computation mediated by ancillary qudits and spin coherent states. Physical Review A, 91(1), Article 012308. https://doi.org/10.1103/physreva.91.012308
Journal Article Type | Article |
---|---|
Online Publication Date | Jan 8, 2015 |
Publication Date | Jan 8, 2015 |
Deposit Date | Jun 27, 2016 |
Publicly Available Date | Jul 28, 2016 |
Journal | Physical Review A |
Print ISSN | 2469-9926 |
Electronic ISSN | 2469-9934 |
Publisher | American Physical Society |
Peer Reviewed | Peer Reviewed |
Volume | 91 |
Issue | 1 |
Article Number | 012308 |
DOI | https://doi.org/10.1103/physreva.91.012308 |
Public URL | https://durham-repository.worktribe.com/output/1380434 |
Related Public URLs | http://arxiv.org/pdf/1402.6674 |
Files
Published Journal Article
(1.1 Mb)
PDF
Copyright Statement
Reprinted with permission from the American Physical Society: Physical Review A 91, 012308 © (2015) by the American Physical Society. Readers may view, browse, and/or download material for temporary copying purposes only, provided these uses are for noncommercial personal purposes. Except as provided by law, this material may not be further reproduced, distributed, transmitted, modified, adapted, performed, displayed, published, or sold in whole or part, without prior written permission from the American Physical Society.
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