Campbell, E. (2017) Shorter gate sequences for quantum computing by mixing unitaries. Physical Review A, 95 (4). 042306. ISSN 2469-9926
Abstract
Fault-tolerant quantum computers compose elements of a discrete gate set in order to approximate a target unitary. The problem of minimizing the number of gates is known as gate synthesis. The approximation error is a form of coherent noise, which can be significantly more damaging than comparable incoherent noise. We show how mixing over different gate sequences can convert this coherent noise into an incoherent form. As measured by diamond distance, the postmixing noise is quadratically smaller than before mixing, without increasing resource cost upper bounds. Equivalently, we can look for shorter gate sequences that achieve the same precision as unitary gate synthesis. For a broad class of problems this gives a factor 1/2reduction in worst-case resource costs.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 American Physical Society. This is an author produced version of a paper subsequently published in Physical Review A. Uploaded in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) > Department of Physics and Astronomy (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 07 Apr 2017 14:52 |
Last Modified: | 21 Mar 2018 21:12 |
Published Version: | https://doi.org/10.1103/PhysRevA.95.042306 |
Status: | Published |
Publisher: | American Physical Society |
Refereed: | Yes |
Identification Number: | 10.1103/PhysRevA.95.042306 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:114642 |