1D Cluster State Generation On Superconducting Hardware

• URL: http://arxiv.org/abs/2508.21798v2
• Date: Tue, 02 Sep 2025 20:19:22 GMT
• Title: 1D Cluster State Generation On Superconducting Hardware
• Abstract summary: Measurement-based Quantum Computation utilize entanglement as resource for performing quantum computation.<n> generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC.<n>We provide analytical derivations and numerical validations for 4-qubit cluster state.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state with charge-qubit arrrays, we provide analytical derivations and numerical validations for 4-qubit cluster state. We compare our fidelities under ideal (noise-free) Hamiltonian evolution and due to effect of decoherence. We show incorporating energy relaxation ($T_1$) yields $>$90\% fidelity while pure dephasing $T_2$ show $70\%$ decays at fourth harmonics. We further show under noise $T_2$ decays to 50\% within 15 time units, versus $>$70\% under relaxation time units ($T_1$)--only. This decay quantify degradation effect of $T_2$ on preparing cluster--state preparation is more than $T_1$. We highlight the critical need for targeted error-mitigation strategies in near-term MBQC implementations.

Related papers

• Demonstrating Quadratic Monte Carlo Speedup via Quantum Amplitude Estimation: Nuclear Engineering Examples [0.0]
  We demonstrate quantum amplitude estimation (QAE) as a route to quadratic speedup for Monte Carlo-type expectation values in nuclear engineering.<n>Using QPE-based QAE, we study two examples: a discrete fission-neutron-yield expectation and a U-238 resonance integral under a $1/E$ slowing-down spectrum.
  arXiv  Detail & Related papers  (2026-07-12T14:03:29Z)
• Adiabatic Quantum Phase Estimation [47.3103723337301]
  Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $$ in Heisenberg-limited time $T= (1/)$.<n>Standard gate-based implementations of QPE require deep controlled time-evolution circuits and are not native to analog hardware.<n>We present a simple adiabatic protocol for QPE that achieves the optimal Heisenberg-limited scaling $T = Oleft( frac1 logleft(-1right)right)$ in both the precision $$
  arXiv  Detail & Related papers  (2026-05-21T17:31:36Z)
• Probing Quantum Entanglement in $τ^+τ^-$ Pairs via the $ππ$ Channel at STCF [7.941172053476731]
  Quantum entanglement and Bell-inequality violation in $+-$ pairs provide a sensitive probe of quantum correlations in high-energy interactions.<n>Super Tau-Charm Facility can provide a competitive platform for precision studies of quantum correlations in $$-lepton pairs.
  arXiv  Detail & Related papers  (2026-05-02T04:10:09Z)
• Blind Catalytic Quantum Error Correction: Target-State Estimation and Fidelity Recovery Without \ extit{A Priori} Knowledge [0.0]
  We introduce emphblind CQEC, which estimates the target from the noisy output alone before catalytic recovery.<n>Five estimation strategies are benchmarked across three noise models.
  arXiv  Detail & Related papers  (2026-04-13T08:27:08Z)
• qc-kmeans: A Quantum Compressive K-Means Algorithm for NISQ Devices [3.4129039170001314]
  Clustering on NISQ hardware is constrained by data loading and limited qubits.<n>We present qc-kmeans, a hybrid $k$-means that summarizes a dataset with a constant-size Fourier-feature sketch and selects centroids by solving small per-group QUBOs with shallow QAOA circuits.
  arXiv  Detail & Related papers  (2025-10-26T05:44:17Z)
• Sublinear Time Quantum Sensitivity Sampling [57.356528942341534]
  We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems.<n>Our framework provides a streamlined approach for constructing coresets and offers significant runtime improvements in applications such as clustering, regression, and low-rank approximation.
  arXiv  Detail & Related papers  (2025-09-20T20:18:49Z)
• Programmable Quantum Matter: Heralding Large Cluster States in Driven Inhomogeneous Spin Ensembles [0.0]
  Atom-like emitters in solids are promising platforms for quantum sensing and information processing.<n>We present a framework that leverages this diversity to reduce the resources for generating optically heralded spin cluster states.<n>An optimized pulse sequence simultaneously corrects pulse-length and detuning errors, achieving single-qubit gate fidelities exceeding $99.99%$ for errors.
  arXiv  Detail & Related papers  (2025-09-03T03:59:22Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Quantum Error-Corrected Computation of Molecular Energies [0.7018475907464546]
  We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation.<n>We calculate the ground-state energy of molecular hydrogen, using quantum phase estimation (QPE) on qubits encoded with the $[7,3]]$ color code on Quantinuum H2-2.<n>We find that orienting the QEC protocols towards higher memory noise protection is the most promising avenue to improve our experimental results.
  arXiv  Detail & Related papers  (2025-05-14T04:34:48Z)
• Quantum Error Suppression with Subgroup Stabilisation [3.4719087457636792]
  Quantum state purification is the functionality that, given multiple copies of an unknown state, outputs a state with increased purity. We propose an effective state purification gadget with a moderate quantum overhead by projecting $M$ noisy quantum inputs to their subspace. Our method, applied in every short evolution over $M$ redundant copies of noisy states, can suppress both coherent and errors by a factor of $1/M$, respectively.
  arXiv  Detail & Related papers  (2024-04-15T17:51:47Z)
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy [6.81054341190257]
  We develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach. We evaluate our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.
  arXiv  Detail & Related papers  (2024-02-21T17:45:03Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Sachdev-Ye-Kitaev model on a noisy quantum computer [1.0377683220196874]
  We study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. We compute return probability after time $t$ and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.
  arXiv  Detail & Related papers  (2023-11-29T19:00:00Z)
• Error-mitigated fermionic classical shadows on noisy quantum devices [0.3775283002059579]
  Classical shadow (CS) algorithms offer a solution by reducing the number of quantum state copies needed. We propose an error-mitigated CS algorithm assuming gate-independent, time-stationary, and Markovian (GTM) noise. Our algorithm efficiently estimates $k$-RDMs with $widetildemathcal O(knk)$ state copies and $widetildemathcal O(sqrtn)$ calibration measurements for GTM noise.
  arXiv  Detail & Related papers  (2023-10-19T13:27:19Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.