State-dependent Routing Dynamics in Noisy Quantum Computing Devices

• URL: http://arxiv.org/abs/2012.13131v2
• Date: Thu, 13 May 2021 11:58:23 GMT
• Title: State-dependent Routing Dynamics in Noisy Quantum Computing Devices
• Authors: Ronald J. Sadlier and Travis S. Humble
• Abstract summary: We develop a model for state-dependent routing dynamics in a NISQ processor based on correlated binary noise. These results capture the state-dependent routing dynamics that are needed to guide routing decisions for near-real time operation of NISQ devices.
• Score: 0.40611352512781856
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Routing plays an important role in programming noisy, intermediate-scale quantum (NISQ) devices, where limited connectivity in the register is overcome by swapping quantum information between locations. However, routing a quantum state using noisy gates introduces non-trivial noise dynamics, and deciding on an optimal route to minimize accumulated error requires estimates of the expected state fidelity. Here we validate a model for state-dependent routing dynamics in a NISQ processor based on correlated binary noise. We develop a composable, state-dependent noise model for CNOT and SWAP operations that can be characterized efficiently using pair-wise experimental measurements, and we compare model predictions with tomographic state reconstructions recovered from a quantum device. These results capture the state-dependent routing dynamics that are needed to guide routing decisions for near-real time operation of NISQ devices.

Related papers

• NISQ-compatible quantum cryptography based on Parrondo dynamics in discrete-time quantum walks [0.0]
  Compatibility with noisy intermediate-scale quantum (NISQ) devices is crucial for the realistic implementation of quantum cryptographic protocols.<n>We construct an explicit quantum circuit realization tailored to NISQ architectures.<n>We show that qubit selection and connectivity play a decisive role in determining fidelity and overall protocol performance.
  arXiv  Detail & Related papers  (2026-02-16T12:06:44Z)
• Routing Qubits on Noisy Networks [0.0]
  We encode information in the position of a quantum walker on a graph, modelling the routing of a generic qubit state from a single input to multiple outputs.<n>We analyse and assess routing performance in various regimes, evaluating their robustness against static and dynamical noise.
  arXiv  Detail & Related papers  (2026-01-21T09:51:06Z)
• Adaptive Fidelity Estimation for Quantum Programs with Graph-Guided Noise Awareness [30.900274564864223]
  QuFid is an adaptive and noise-aware framework that determines measurement budgets online.<n>We show that QuFid significantly reduces measurement cost compared to fixed-shot and learning-based baselines.
  arXiv  Detail & Related papers  (2026-01-21T07:04:05Z)
• TRAM: A Transverse Relaxation Time-Aware Qubit Mapping Algorithm for NISQ Devices [4.069193337175605]
  We present TRAM (Transverse Relaxation Time-Aware Qubit Mapping), a coherence-guided compilation framework.<n>TRAM integrates calibration-informed community detection to construct noise-resilient qubit partitions.<n>It outperforms SABRE by 3.59% in fidelity, reduces gate count by 11.49%, and shortens circuit depth by 12.28%.
  arXiv  Detail & Related papers  (2025-11-20T05:11:36Z)
• Resource-Efficient Hadamard Test Circuits for Nonlinear Dynamics on a Trapped-Ion Quantum Computer [1.2063443893298391]
  We propose a low-depth implementation of a class of Hadamard test circuits.<n>We develop a parameterized quantum ansatz specifically tailored for variational algorithms.<n>Our findings demonstrate a significant reduction in single- and two-qubit gate counts.
  arXiv  Detail & Related papers  (2025-07-25T13:16:54Z)
• Simulating Quantum State Transfer between Distributed Devices using Noisy Interconnects [39.79428554301806]
  Scaling beyond individual quantum devices via distributed quantum computing relies on high-fidelity quantum state transfers between devices.<n>These limitations can be bypassed by simulating ideal state transfer using quasiprobability decompositions (QPDs)<n>This work presents a generalized and practical QPD for state transfer simulation using noisy interconnects to reduce sampling overhead.
  arXiv  Detail & Related papers  (2025-07-02T13:07:52Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Dynamic Estimation Loss Control in Variational Quantum Sensing via Online Conformal Inference [39.72602887300498]
  Current variational quantum sensing methods lack rigorous performance guarantees.<n>This paper proposes an online control framework for VQS that dynamically updates the variational parameters while providing deterministic error bars on the estimates.<n> Experiments on a quantum magnetometry task confirm that the proposed dynamic VQS approach maintains the required reliability over time, while still yielding precise estimates.
  arXiv  Detail & Related papers  (2025-05-29T12:19:07Z)
• Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits [3.2559508547981917]
  In the current NISQ era, simulating and verifying noisy quantum circuits is crucial. This paper introduces an approximation algorithm for simulating and assessing the equivalence of noisy quantum circuits.
  arXiv  Detail & Related papers  (2025-03-13T13:19:30Z)
• Bayesian Quantum Amplitude Estimation [49.1574468325115]
  We introduce BAE, a noise-aware Bayesian algorithm for quantum amplitude estimation. We show that BAE achieves Heisenberg-limited estimation and benchmark it against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Compressed-sensing Lindbladian quantum tomography with trapped ions [44.99833362998488]
  Characterizing the dynamics of quantum systems is a central task for the development of quantum information processors. We propose two different improvements of Lindbladian quantum tomography (LQT) that alleviate previous shortcomings.
  arXiv  Detail & Related papers  (2024-03-12T09:58:37Z)
• Enhancing Quantum Variational Algorithms with Zero Noise Extrapolation via Neural Networks [0.4779196219827508]
  Variational Quantum Eigensolver (VQE) is a promising algorithm for solving complex quantum problems. The ubiquitous presence of noise in quantum devices often limits the accuracy and reliability of VQE outcomes. This research introduces a novel approach by utilizing neural networks for zero noise extrapolation (ZNE) in VQE computations.
  arXiv  Detail & Related papers  (2024-03-10T15:35:41Z)
• Comparing resource requirements of noisy quantum simulation algorithms for the Tavis-Cummings model [0.0]
  Fault-tolerant quantum computers could facilitate the simulation of quantum systems unfeasible for classical computation. These include quantum error mitigation (QEM) for alleviating device noise, and variational quantum algorithms (VQAs) which combine classical optimization with short-depth, parameterized quantum circuits. We compare two such methods: zero-noise extrapolation (ZNE) with noise amplification by circuit folding, and incremental structural learning (ISL) We find that while ISL achieves lower error than ZNE for smaller system sizes, it fails to produce correct dynamics for 4 qubits, where ZNE is superior.
  arXiv  Detail & Related papers  (2024-02-26T16:06:24Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer [41.94295877935867]
  Crosstalk errors, stemming from CNOT two-qubit gates, are a crucial source of errors on numerous quantum computing platforms. We develop and apply an extension of the randomized compiling protocol that includes a special treatment of neighboring qubits. Our twirling of neighboring qubits is shown to dramatically improve the noise estimation protocol without the need to add new qubits or circuits.
  arXiv  Detail & Related papers  (2023-05-03T18:00:02Z)
• Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
  In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes. We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee. Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
  arXiv  Detail & Related papers  (2023-04-10T07:16:51Z)
• Deep Reinforcement Learning for IRS Phase Shift Design in Spatiotemporally Correlated Environments [93.30657979626858]
  We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion. We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
  arXiv  Detail & Related papers  (2022-11-02T22:07:36Z)
• Noise tailoring for Robust Amplitude Estimation [0.0]
  A universal fault-tolerant quantum computer holds the promise to speed up computational problems that are otherwise intractable on classical computers. For the next decade or so, our access is restricted to noisy intermediate-scale quantum (NISQ) computers and, perhaps, early fault tolerant (EFT) quantum computers. This motivates the development of many near-term quantum algorithms including robust amplitude estimation (RAE) We show that our noise-tailored RAE algorithm is able to regain improvements in both bias and precision that are expected for RAE.
  arXiv  Detail & Related papers  (2022-08-24T23:51:21Z)
• Optimal quantum control via genetic algorithms for quantum state engineering in driven-resonator mediated networks [68.8204255655161]
  We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. We consider a network of qubits -- encoded in the states of artificial atoms with no direct coupling -- interacting via a common single-mode driven microwave resonator. We observe high quantum fidelities and resilience to noise, despite the algorithm being trained in the ideal noise-free setting.
  arXiv  Detail & Related papers  (2022-06-29T14:34:00Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Approximate Equivalence Checking of Noisy Quantum Circuits [8.36229449571485]
  We study the problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity. We present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation.
  arXiv  Detail & Related papers  (2021-03-22T05:47:41Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Modeling Noisy Quantum Circuits Using Experimental Characterization [0.40611352512781856]
  Noisy intermediate-scale quantum (NISQ) devices offer unique platforms to test and evaluate the behavior of non-fault-tolerant quantum computing. We present a test-driven approach to characterizing NISQ programs that manages the complexity of noisy circuit modeling.
  arXiv  Detail & Related papers  (2020-01-23T16:45:49Z)

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.