Signatures of quantum noise in the operation of Deutsch's algorithm

• URL: http://arxiv.org/abs/2605.19047v1
• Date: Mon, 18 May 2026 19:13:03 GMT
• Title: Signatures of quantum noise in the operation of Deutsch's algorithm
• Abstract summary: We study how quantum properties of an environment manifest themselves in results that can be obtained on quantum computers.<n>We find that a single run of the algorithm yields the same effect in both cases, but running the algorithm twice leads to stark differences.<n>We present results obtained on one of the IBM Quantum processors, which fully reproduce the predicted effect regardless of the assumptions made in the derivation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We use Deutsch's algorithm as a stand in for more complex quantum algorithms in order to determine how quantum properties of an environment manifest themselves in results that can be obtained on quantum computers. We model pure dephasing in two different ways; one keeps the full density matrix of the qubits and environments (quantum) while the other uses Kraus operators (classical). We find that a single run of the algorithm yields the same effect in both cases, but running the algorithm twice leads to stark differences. Taking correlations and interplay between different decoherence processes into account leads to a slowing of decoherence effects for balanced functions. For constant functions, the effect is much more pronounced, and there is a qualitative change in the dependence of measurement outcomes on decoherence. We present results obtained on one of the IBM Quantum processors, which fully reproduce the predicted effect regardless of the assumptions made in the derivation. We further illustrate the findings on NV center spin qubits, which show more complex behavior due to a small size of the environment.

Related papers

• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Noise-Mitigated Variational Quantum Eigensolver with Pre-training and Zero-Noise Extrapolation [3.205475178870021]
  We develop an efficient noise-mitigating variational quantum eigensolver for accurate computation of molecular ground state energies in noisy environments.<n>We employ zero-noise extrapolation to mitigate quantum noise and combine it with neural networks to improve the accuracy of the noise-fitting function.<n>Results show that our algorithm can constrain noise errors within the range of $mathcalO(10-2) sim mathcalO(10-1)$, outperforming mainstream variational quantum eigensolvers.
  arXiv  Detail & Related papers  (2025-01-03T05:34:36Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems [0.0]
  We propose a variational method for solving the non-Hermitian Hamiltonian on a quantum computer. The energy is set as a parameter in the cost function and can be tuned to obtain the whole spectrum. Our work suggests an avenue for solving non-Hermitian quantum many-body systems with variational quantum algorithms on near-term noisy quantum computers.
  arXiv  Detail & Related papers  (2023-05-31T12:50:22Z)
• Error Analysis of the Variational Quantum Eigensolver Algorithm [0.18188255328029254]
  We study variational quantum eigensolver (VQE) and its individual quantum subroutines. We show through explicit simulation that the VQE algorithm effectively collapses already when single errors occur during a quantum processing call.
  arXiv  Detail & Related papers  (2023-01-18T02:02:30Z)
• 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)
• Quantum simulation of dissipative collective effects on noisy quantum computers [0.0]
  We put forward the first fully quantum simulation of dissipative collective phenomena on a real quantum computer. The quantum simulation is based on the recently introduced multipartite collision model. We implement the algorithm on some IBM quantum computers to simulate superradiance and subradiance between a pair of qubits.
  arXiv  Detail & Related papers  (2022-01-27T15:50:58Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Near-term Efficient Quantum Algorithms for Entanglement Analysis [5.453850739960517]
  Entanglement plays a crucial role in quantum physics and is the key resource in quantum information processing. This work proposes three near-term efficient algorithms exploiting the hybrid quantum-classical technique to address this difficulty.
  arXiv  Detail & Related papers  (2021-09-22T15:15:58Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18: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.