dorsal/arxiv
View SchemaRobust Quantum Error Correction via Convex Optimization
| Authors | R. L. Kosut, A. Shabani, D. A. Lidar |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0703274 |
| URL | https://arxiv.org/abs/quant-ph/0703274 |
| DOI | 10.1103/PhysRevLett.100.020502 |
| Journal | Phys. Rev. Lett. 100, 020502 (2008) |
Abstract
We present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity. We illustrate our theory numerically for optimized 5-qubit codes, using the standard [5,1,3] code as a benchmark. Our optimized encoding and recovery yields fidelities that are uniformly higher by 1-2 orders of magnitude against random unitary weight-2 errors compared to the [5,1,3] code with standard recovery. We observe similar improvement for a 4-qubit decoherence-free subspace code.
{
"annotation_id": "2402c858-781e-4062-bf66-1bd6de887438",
"date_created": "2026-03-02T18:02:37.845000Z",
"date_modified": "2026-03-02T18:02:37.845000Z",
"file_hash": "7fcce9368151da8684d55233b723e8de997ed31ad336d2642213cdd0679a0b99",
"private": false,
"record": {
"abstract": "We present a semidefinite program optimization approach to quantum error\ncorrection that yields codes and recovery procedures that are robust against\nsignificant variations in the noise channel. Our approach allows us to optimize\nthe encoding, recovery, or both, and is amenable to approximations that\nsignificantly improve computational cost while retaining fidelity. We\nillustrate our theory numerically for optimized 5-qubit codes, using the\nstandard [5,1,3] code as a benchmark. Our optimized encoding and recovery\nyields fidelities that are uniformly higher by 1-2 orders of magnitude against\nrandom unitary weight-2 errors compared to the [5,1,3] code with standard\nrecovery. We observe similar improvement for a 4-qubit decoherence-free\nsubspace code.",
"arxiv_id": "quant-ph/0703274",
"authors": [
"R. L. Kosut",
"A. Shabani",
"D. A. Lidar"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevLett.100.020502",
"journal_ref": "Phys. Rev. Lett. 100, 020502 (2008)",
"title": "Robust Quantum Error Correction via Convex Optimization",
"url": "https://arxiv.org/abs/quant-ph/0703274"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1a5f78e2-40d5-430d-84ba-b4323f797fb8",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}