Skip to content

Commit

Permalink
refs
Browse files Browse the repository at this point in the history
  • Loading branch information
valbert4 committed Sep 6, 2024
1 parent c444321 commit ff0462b
Show file tree
Hide file tree
Showing 4 changed files with 7 additions and 3 deletions.
2 changes: 1 addition & 1 deletion codes/quantum/oscillators/stabilizer/lattice/gkp.yml
Original file line number Diff line number Diff line change
Expand Up @@ -50,7 +50,7 @@ features:

realizations:
- 'Motional degree of freedom of a trapped ion: square-lattice GKP encoding realized with the help of post-selection by Home group \cite{arxiv:1807.01033,arxiv:1907.06478}, followed by realization of reduced form of GKP error correction, where displacement error syndromes are measured to one bit of precision using an ion electronic state \cite{arxiv:2010.09681}. State preparation also realized by Tan group \cite{arxiv:2310.15546}.'
- 'Microwave cavity coupled to superconducting circuits: reduced form of square-lattice GKP error correction, where displacement error syndromes are measured to one bit of precision using an ancillary transmon \cite{arxiv:1907.12487}. Subsequent paper by Devoret group \cite{arxiv:2211.09116} uses reinforcement learning for error-correction cycle design and is the first to go beyond break-even error-correction, with the lifetime of a logical qubit exceeding the cavity lifetime by about a factor of two (see also \cite{arxiv:2211.09319}). See Ref. \cite{arxiv:2111.07965} for another experiment. A feed-forward-free, i.e., fully autonomous protocol has also been implemented \cite{arxiv:2310.11400}.'
- 'Microwave cavity coupled to superconducting circuits: reduced form of square-lattice GKP error correction, where displacement error syndromes are measured to one bit of precision using an ancillary transmon \cite{arxiv:1907.12487}. Subsequent paper by Devoret group \cite{arxiv:2211.09116} uses reinforcement learning for error-correction cycle design and is the first to go beyond break-even error-correction, with the lifetime of a logical qubit exceeding the cavity lifetime by about a factor of two (see also \cite{arxiv:2211.09319}). See Ref. \cite{arxiv:2111.07965} for another experiment. A feed-forward-free, i.e., fully autonomous protocol has also been implemented by Nord Quantique \cite{arxiv:2310.11400}.'
- 'GKP states and homodyne measurements have been realized in propagating telecom light by the Furusawa group \cite{arxiv:2309.02306}.'
- 'Single-qubit \(Z\)-gate has been demonstrated \cite{arxiv:1904.01351} in the single-photon subspace of an infinite-mode space \cite{arxiv:2310.12618}, in which time and frequency become bosonic conjugate variables of a single effective bosonic mode. In this context, GKP position-state wavefunctions are called Dirac combs or frequency combs.'

Expand Down
2 changes: 1 addition & 1 deletion codes/quantum/qubits/small_distance/small/stab_8_3_2.yml
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ features:
realizations:
- 'Trapped ions: one-qubit addition algorithm implemented fault-tolerantly on the Quantinuum H1-1 device \cite{arxiv:2309.09893}.'
- 'Superconducting circuits: fault-tolerant \(CZZ\) gate performed on IBM and IonQ devices \cite{arxiv:2309.08663}.'
- 'Rydberg atom arrays: Lukin group \cite{arxiv:2308.08648}. 48 logical qubits, 228 logical two-qubit gates, 48 logical CCZ gates, and error detection peformed in 16 blocks.
- 'Rydberg atom arrays: Lukin group \cite{arxiv:2312.03982}. 48 logical qubits, 228 logical two-qubit gates, 48 logical CCZ gates, and error detection peformed in 16 blocks.
Circuit outcomes were sampled and cross-entropy (XEB) was calculated to verify quantumness. Logical entanglement entropy was measured \cite{arxiv:2312.03982}.'

relations:
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -33,6 +33,8 @@ description: |
protection: |
The planar 3D surface code family on a cubic lattice of length \(L\) has parameters \([[2L(L-1)^2+L^3,1,d_X=L^2,d_Z=L]]\), while the 3D toric code has parameters \([[3L^3,3,d_X=L^2,d_Z=L]]\).
Stability against Hamiltonian perturbations was determined using a tensor-network representation \cite{arxiv:2012.15346}. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.
# The \textit{Kirigami code} \cite{} consists of three copies of the 3D surface code.

#protection: As a stabilizer code, \([[n=O(d^2), k=O(1), d]]\).
Expand Down Expand Up @@ -76,6 +78,8 @@ relations:
detail: 'The Chamon and 3D surface codes can both be built out of a hypergraph product of three repetition codes; see \cite[Sec. 3.4]{arxiv:2011.09746}.'
- code_id: rotated_surface
detail: 'There exists a rotated version of the 3D surface code, akin to the (2D) rotated surface code \cite{arxiv:2211.02116}.'
- code_id: hamiltonian
detail: 'Stability of the 3D surface code against Hamiltonian perturbations was determined using a tensor-network representation \cite{arxiv:2012.15346}. The phase diagram of the perturbed tensor network maps to that of a 3D Ising gauge theory.'


# Begin Entry Meta Information
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ realizations:
This increase in error-correcting capabilities while using more physical qubits supports the notion of an error threshold.
Braiding of defects has been demonstrated for the distance-five code \cite{arxiv:2210.10255}. Leakage errors have been handled in a separate work in a distance-three code \cite{arxiv:2211.04728}.
Google Quantum AI follow-up experiment realizing distance-5 and distance-7 codes with 100 rounds of correction using the Libra and transformer-based decoders. The logical error rate is suppressed by a factor of \(\approx 2\), demonstrating beyond-break-even error correction with a block quantum code \cite{arxiv:2408.13687}.
- 'Rydberg atom arrays: Lukin group \cite{arxiv:2308.08648}. Transversal CNOT gates performed on distance \(3\), \(5\), and \(7\) codes.'
- 'Rydberg atom arrays: Lukin group \cite{arxiv:2312.03982}. Transversal CNOT gates performed on distance \(3\), \(5\), and \(7\) codes.'

notes:
- 'A single \(X\) or \(Z\) error gives rise to two nearby defects, which can be viewed as endpoints of a string. That way, multiple \(Z\) errors can be decomposed into a combination of diagonal strings.'
Expand Down

0 comments on commit ff0462b

Please sign in to comment.