Finding good quantum codes using the Cartan form
We present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of merit for quantifying code performance, a much better indica...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/147495 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-147495 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1474952023-02-28T19:30:03Z Finding good quantum codes using the Cartan form Jayashankar, Akshaya Babu, Anjala, M. Ng, Hui Khoon Mandayam, Prabha School of Physical and Mathematical Sciences Science::Physics Quantum Channels Quantum Error Correction We present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of merit for quantifying code performance, a much better indicator of code quality than, say, entanglement fidelity. Yet, our algorithm does not suffer from inefficiencies usually associated with the use of worst-case fidelity. Specifically, using a near-optimal recovery map, we are able to reduce the triple numerical optimization needed for the search to a single optimization over the encoding map. We can further reduce the search space using the Cartan decomposition, focusing our search over the nonlocal degrees of freedom resilient against independent per-qubit noise, while not suffering much in code performance. Published version 2021-04-06T04:11:34Z 2021-04-06T04:11:34Z 2019 Journal Article Jayashankar, A., Babu, A. M., Ng, H. K. & Mandayam, P. (2019). Finding good quantum codes using the Cartan form. Physical Review A, 101(4). https://dx.doi.org/10.1103/PhysRevA.101.042307 2469-9926 https://hdl.handle.net/10356/147495 10.1103/PhysRevA.101.042307 2-s2.0-85084935045 4 101 en Physical Review A © 2020 American Physical Society. All rights reserved. This paper was published in Physical Review A and is made available with permission of American Physical Society. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Physics Quantum Channels Quantum Error Correction |
spellingShingle |
Science::Physics Quantum Channels Quantum Error Correction Jayashankar, Akshaya Babu, Anjala, M. Ng, Hui Khoon Mandayam, Prabha Finding good quantum codes using the Cartan form |
description |
We present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of merit for quantifying code performance, a much better indicator of code quality than, say, entanglement fidelity. Yet, our algorithm does not suffer from inefficiencies usually associated with the use of worst-case fidelity. Specifically, using a near-optimal recovery map, we are able to reduce the triple numerical optimization needed for the search to a single optimization over the encoding map. We can further reduce the search space using the Cartan decomposition, focusing our search over the nonlocal degrees of freedom resilient against independent per-qubit noise, while not suffering much in code performance. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Jayashankar, Akshaya Babu, Anjala, M. Ng, Hui Khoon Mandayam, Prabha |
format |
Article |
author |
Jayashankar, Akshaya Babu, Anjala, M. Ng, Hui Khoon Mandayam, Prabha |
author_sort |
Jayashankar, Akshaya |
title |
Finding good quantum codes using the Cartan form |
title_short |
Finding good quantum codes using the Cartan form |
title_full |
Finding good quantum codes using the Cartan form |
title_fullStr |
Finding good quantum codes using the Cartan form |
title_full_unstemmed |
Finding good quantum codes using the Cartan form |
title_sort |
finding good quantum codes using the cartan form |
publishDate |
2021 |
url |
https://hdl.handle.net/10356/147495 |
_version_ |
1759854921287467008 |