Shallow-depth GHZ state generation on NISQ devices

• URL: http://arxiv.org/abs/2507.19145v1
• Date: Fri, 25 Jul 2025 10:33:30 GMT
• Title: Shallow-depth GHZ state generation on NISQ devices
• Authors: S. Siddardha Chelluri, Stephan Schuster, Sumeet, Riccardo Roma,
• Abstract summary: We study the GHZ state preparation across different connectivity graphs inspired by IBM and Google chip architectures.<n>Our approach is a measurement-based protocol designed to utilize qubit connectivity constraints for the generation of GHZ states on NISQ devices.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we focus on GHZ state generation under the practical constraint of limited qubit connectivity, a hallmark of current NISQ hardware. We study the GHZ state preparation across different connectivity graphs inspired by IBM and Google chip architectures, as well as random graphs that reflect distributed quantum systems. Our approach is a measurement-based protocol designed to utilize qubit connectivity constraints for the generation of GHZ states on NISQ devices. We benchmark this against a tailored version of state-of-the-art unitary-based protocols, also incorporating physical connectivity limitations. To evaluate the performance of the protocols under realistic conditions, we conducted implementations on the IBM Eagle r3 chip. Additionally, to explore near-term scalability, we performed simulations across a range of graph sizes and connectivity configurations, assessing performance based on circuit depth, the number of two-qubit gates, and measurement overhead. We observe a trade-off between the two protocols across different figures of merit. For current state-of-the-art NISQ architectures, the unitary-based protocol is more suitable, as it avoids mid-circuit measurements and classical feedforward. However, the measurement-based protocol is expected to become more advantageous in the future with more error-resilient quantum devices, owing to its reduced circuit depth and consequently shorter execution times. In both settings, our proposed method provides an efficient means of leveraging the topology of qubit connections available on a given device.

Related papers

• Long-distance device-independent quantum key distribution with standard optics tools [0.0]
  Device-independent quantum key distribution (DI-QKD) enables information-theoretically secure key distribution between remote parties.<n>We propose two long-distance DI-QKD protocols which use a heralding scheme based on single-photon interference.
  arXiv  Detail & Related papers  (2025-08-04T10:10:59Z)
• ProtocolLLM: RTL Benchmark for SystemVerilog Generation of Communication Protocols [45.66401695351214]
  We introduce ProtocolLLM, the first benchmark suite specifically targeting widely used SystemVerilog protocols.<n>We observe that most of the models fail to generate SystemVerilog code for communication protocols that follow timing constrains.
  arXiv  Detail & Related papers  (2025-06-09T17:10:47Z)
• Spatial and temporal circuit cutting with hypergraphic partitioning [0.0]
  This paper presents a hypergraph-based circuit cutting methodology suitable for both spatial and temporal scenarios.<n>By modeling quantum circuits as high-level hypergraphs, we apply partitionings such as Stoer-Wagner, Fiduccia-Mattheyses, and Kernighan-Lin.
  arXiv  Detail & Related papers  (2025-04-12T20:31:07Z)
• Space-time tradeoff in networked virtual distillation [0.0]
  Virtual distillation is a technique that can, under ideal conditions, suppress errors exponentially as the number of quantum state copies increases.<n>We analyse three practical implementations of VD that correspond to edge cases that maximise space-time tradeoffs.<n>We numerically compare the performance of the three implementations under realistic noise characteristics of networked ion trap systems.
  arXiv  Detail & Related papers  (2025-03-25T01:07:58Z)
• Deterministic generation of multi-qubit entangled states among distant parties using indefinite causal order [1.556591713973462]
  We present protocols for generating $N$-qubit entangled states across multiple network nodes.<n>The results indicate that our protocols significantly improve the efficiency of long-distance entanglement generation.
  arXiv  Detail & Related papers  (2025-03-05T11:40:19Z)
• Multi-user QKD using quotient graph states derived from continuous-variable dual-rail cluster states [0.0]
  Multipartite entangled states are fundamental resources for multi-user quantum cryptographic tasks.<n>We introduce a novel protocol for generating three user conference keys using a CV dual-rail cluster state.
  arXiv  Detail & Related papers  (2024-12-18T20:35:12Z)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• Architecture and protocols for all-photonic quantum repeaters [0.49157446832511503]
  All-photonic quantum repeater scheme promises resilience to photon losses and operational errors. We propose a new emitter-photonic qubit building block and an RGS protocol that addresses several key considerations. Our proposed building block significantly reduces the total number of emissive quantum memories required for end nodes.
  arXiv  Detail & Related papers  (2023-06-06T15:08:50Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Toward fast and accurate human pose estimation via soft-gated skip connections [97.06882200076096]
  This paper is on highly accurate and highly efficient human pose estimation. We re-analyze this design choice in the context of improving both the accuracy and the efficiency over the state-of-the-art. Our model achieves state-of-the-art results on the MPII and LSP datasets.
  arXiv  Detail & Related papers  (2020-02-25T18:51:51Z)

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.