Efficient quantum state preparation on Quantinuum hardware

• URL: http://arxiv.org/abs/2609.08414v1
• Date: Tue, 08 Sep 2026 08:23:15 GMT
• Title: Efficient quantum state preparation on Quantinuum hardware
• Abstract summary: We have demonstrated an end-to-end framework that combines resource-efficient quantum state preparation with rapid, robust fidelity verification on near-term quantum hardware.<n>We achieved a high hardware fidelity of $F_mathrmhw = 0.929$ on the Quantinuum H2-1 trapped-ion platform.
• Score: 5.8774791521019765
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Preparation and verification of specific quantum states is an important capability for quantum devices to realise advantages over classical computations and algorithms. In this work, we have demonstrated an end-to-end framework that combines resource-efficient quantum state preparation with rapid, robust fidelity verification on near-term quantum hardware. By experimentally preparing and validating a structured complex quantum state encoding a digitized acoustic signal on the Quantinuum H2-1 trapped-ion platform, we achieved a high hardware fidelity of $F_{\mathrm{hw}} = 0.929$. Crucially, this milestone was realized without relying on idealized assumptions or deep fault-tolerant overhead, but rather through resource-minimal circuits optimized for NISQ-era and early fault-tolerant devices. Furthermore, we addressed a key limitation in current quantum state certification. While validation methods like shadow overlap work well for random states, their sample complexity can become prohibitively high for the structured states used in practical algorithms. We mitigate this by introducing a pre-measurement basis-change technique that reduces the verification parameter, $τ$, by over 10 orders of magnitude for structured targets. This approach tightens the theoretical certification guarantees of the shadow overlap method and integrates tensor-network preparation and shadow validation into a unified workflow. These results shift the paradigm of how structured classical data can be mapped to and verified on quantum hardware under realistic noise and measurement budgets. By compressing a robust verification procedure to just 1,000 measurement shots, this framework offers an immediate, scalable benchmarking standard.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Towards Efficient Verification of Computation in Quantum Devices [12.146871607856037]
  Traditional methods of comprehensively verifying quantum devices, such as quantum process tomography, face significant limitations because of the exponential growth in computational resources.<n>In this paper, we investigate the structure of computations on the hardware, focusing on the layered interruptible quantum circuit model.<n>Our method completely reconstructs the circuits within a time complexity of $O(d2 t log (n/delta))$, guaranteeing success with a probability of at least $1-delta$.<n>Our approach significantly reduces execution time for completely verifying computations in quantum devices, achieving double logarithmic scaling in the problem size.
  arXiv  Detail & Related papers  (2025-08-01T02:10:06Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• An efficient quantum state verification framework and its application to bosonic systems [0.0]
  We introduce a general framework for the efficient verification of large quantum systems. Our framework combines robust fidelity witnesses with efficient classical post-processing to implement measurement back-propagation.
  arXiv  Detail & Related papers  (2024-11-07T13:19:22Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• On-Chip Verified Quantum Computation with an Ion-Trap Quantum Processing Unit [0.5497663232622965]
  We present and experimentally demonstrate a novel approach to verification and benchmarking of quantum computing.<n>Unlike previous information-theoretically secure verification protocols, our approach is implemented entirely on-chip.<n>Our results pave the way for more accessible and efficient verification and benchmarking strategies in near-term quantum devices.
  arXiv  Detail & Related papers  (2024-10-31T16:54:41Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Classical certification of quantum gates under the dimension assumption [0.1874930567916036]
  We introduce a certification method for quantum gates tailored for a practical server-user scenario.<n>For single-qubit gates, including those that form a universal set for single-qubit quantum computation, we demonstrate that our approach offers soundness guarantees.
  arXiv  Detail & Related papers  (2024-01-30T13:40:39Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)

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.