Big cats: entanglement in 120 qubits and beyond

• URL: http://arxiv.org/abs/2510.09520v1
• Date: Fri, 10 Oct 2025 16:30:33 GMT
• Title: Big cats: entanglement in 120 qubits and beyond
• Authors: Ali Javadi-Abhari, Simon Martiel, Alireza Seif, Maika Takita, Ken X. Wei,
• Abstract summary: We report on the largest Greenberger-Horne-Zeilinger (GHZ) state prepared to date consisting of 120 superconducting qubits.<n>GHZ states are easy to verify, but difficult to prepare due to their high sensitivity to noise.
• Score: 1.22448743876522
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement is the quintessential quantum phenomenon and a key enabler of quantum algorithms. The ability to faithfully entangle many distinct particles is often used as a benchmark for the quality of hardware and control in a quantum computer. Greenberger-Horne-Zeilinger (GHZ) states, also known as Schr\"odinger cat states, are useful for this task. They are easy to verify, but difficult to prepare due to their high sensitivity to noise. In this Letter we report on the largest GHZ state prepared to date consisting of 120 superconducting qubits. We do this via a combination of optimized compilation, low-overhead error detection and temporary uncomputation. We use an automated compiler to maximize error-detection in state preparation circuits subject to arbitrary qubit connectivity constraints and variations in error rates. We measure a GHZ fidelity of 0.56(3) with a post-selection rate of 28%. We certify the fidelity of our GHZ states using multiple methods and show that they are all equivalent, albeit with different practical considerations.

Related papers

• Enhancing Kerr-Cat Qubit Coherence with Controlled Dissipation [64.05054054401175]
  Kerr-cat qubit (KCQ) is a bosonic quantum processor.<n>KCQs are experimentally compatible with on-chip architectures and high-fidelity operations.<n>We present direct evidence that the bit-flip time in a KCQ is limited by leakage out of the qubit manifold.
  arXiv  Detail & Related papers  (2025-11-02T17:58:36Z)
• Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors [0.0]
  High-fidelity multi-qubit gates are a critical resource for near-term quantum computing.<n>We present a hardware-aware characterization of the Toffoli gate on IBM's 127-qubit superconducting quantum processors.
  arXiv  Detail & Related papers  (2025-09-05T12:58:13Z)
• Characterization of entanglement on superconducting quantum computers of up to 414 qubits [0.0]
  We study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. A GHZ fidelity of $0.519 pm 0.014$ is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME)
  arXiv  Detail & Related papers  (2023-12-23T05:31:16Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Automated error correction in superdense coding, with implementation on superconducting quantum computer [0.28675177318965034]
  We present a task-specific error-correction technique that provides a complete protection over a restricted set of quantum states. Specifically, we give an automated error correction in Superdense Coding algorithms utilizing n-qubit generalized Bell states. We experimentally realize our automated error correction technique for three different types of superdense coding algorithm on a 7-qubit superconducting IBM quantum computer and also on a 27-qubit quantum simulator in the presence of noise.
  arXiv  Detail & Related papers  (2022-10-27T04:02:13Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Mitigating errors by quantum verification and post-selection [0.0]
  We present a technique for quantum error mitigation based on quantum verification, the so-called accreditation protocol, together with post-selection. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique also allows for time dependant behaviours, as we allow for the output states to be different between different runs of the accreditation protocol.
  arXiv  Detail & Related papers  (2021-09-29T10:29:39Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.