Correlating noise floor with magic and entanglement in Pauli product states

• URL: http://arxiv.org/abs/2505.04743v1
• Date: Wed, 07 May 2025 19:24:00 GMT
• Title: Correlating noise floor with magic and entanglement in Pauli product states
• Authors: Erika Lloyd, Alexandre Fleury, Marc P. Coons, James Brown, Maritza Hernandez,
• Abstract summary: 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.
• Score: 37.69303106863453
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The dependence of quantum algorithms on state fidelity is difficult to characterize analytically and is best explored experimentally as hardware scales and noisy simulations become intractable. While low fidelity states are often disregarded, they may still retain valuable information, as long as their dominant eigenvector approximates the target state. Through classical purification, we demonstrate the ability to recover resources specific to quantum computing such as magic and entanglement from noisy states generated by Pauli product formulas, which are common subroutines of many quantum algorithms. The fidelity of purified states represents the noise floor of a given computation and we show its dependence on both the magnitude and order in which magic and entanglement are generated. Using an ion trap quantum device, we experimentally validate these findings by collecting classical shadow data for a range of small circuits. While overall consistent, our results reveal meaningful differences in the captured qubit correlations, further highlighting the gap between conventional numerical studies and real experimental outcomes. In both simulation and experiment, we show the advantage of designing methods targeting states which are more robust against noise. This study uses quantum informatic tools for analyzing quantum algorithms in a noisy framework, and demonstrates practical strategies for optimizing quantum circuit performance.

Related papers

• Classical Verification of Quantum Learning Advantages with Noises [0.27930367518472443]
  We propose an efficient classical error rectification algorithm to reconstruct the noise-free results given by the quantum Fourier sampling circuit. We also prove that a classical client with access to the random example oracle can verify the agnostic parity learning results from the noisy quantum prover.
  arXiv  Detail & Related papers  (2024-11-14T06:14:39Z)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.366942647553326]
  We propose a robust protocol for characterizing quantum states on current quantum computing platforms.<n>Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity.<n>This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
  arXiv  Detail & Related papers  (2024-02-27T21:53:32Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Learning the Complexity of Weakly Noisy Quantum States [0.5662299435213419]
  We present an efficient learning algorithm, that leverages the classical shadow representation of target quantum states, to predict the circuit complexity of weakly noisy quantum states.<n>Our result builds a bridge between the learning algorithm and quantum state complexity, highlighting the power of the learning algorithm in characterizing intrinsic properties of quantum states.
  arXiv  Detail & Related papers  (2023-03-31T06:02:44Z)
• 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)
• 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)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)
• Neural network quantum state tomography in a two-qubit experiment [52.77024349608834]
  Machine learning inspired variational methods provide a promising route towards scalable state characterization for quantum simulators. We benchmark and compare several such approaches by applying them to measured data from an experiment producing two-qubit entangled states. We find that in the presence of experimental imperfections and noise, confining the variational manifold to physical states greatly improves the quality of the reconstructed states.
  arXiv  Detail & Related papers  (2020-07-31T17:25:12Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

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.