Multifractality Analysis of Single Qubit Quantum Circuit Outcomes for a Superconducting Quantum Computer

• URL: http://arxiv.org/abs/2512.18491v1
• Date: Sat, 20 Dec 2025 20:03:26 GMT
• Title: Multifractality Analysis of Single Qubit Quantum Circuit Outcomes for a Superconducting Quantum Computer
• Authors: Mohammadreza Saghafi, Lamine Mili, Karlton Wirsing,
• Abstract summary: We present a multifractal analysis of time series data obtained by repeatedly running a single-qubit quantum circuit on IBM superconducting quantum computers.<n>This finding indicates that the temporal fluctuations inherent to quantum circuit outputs are not purely random but exhibit complex scaling properties across multiple time scales.
• Score: 2.893006778402251
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a multifractal analysis of time series data obtained by repeatedly running a single-qubit quantum circuit on IBM superconducting quantum computers, in which the measurement outcomes are recorded as the number of zeros. By applying advanced signal processing techniques, including the wavelet leader method and multifractal detrended fluctuation analysis, we uncover strong multifractal behavior in the output data. This finding indicates that the temporal fluctuations inherent to quantum circuit outputs are not purely random but exhibit complex scaling properties across multiple time scales. The multifractal nature of the signal suggests the possibility of tailoring filtering strategies that specifically target these scaling features to effectively mitigate noise in quantum computations. Our results not only contribute to a deeper understanding of the dynamical properties of quantum systems under repeated measurement but also provide a promising avenue for improving noise reduction techniques in near-term quantum devices.

Related papers

• Quantum advantage from effective $200$-qubit holographic random circuit sampling [0.0]
  We introduce a holographic random circuit sampling algorithm that substantially increases the sampling complexity.<n>We experimentally demonstrate the effective sampling of up to 200 qubits, with a cross-entropy benchmark fidelity of $0.0593$.
  arXiv  Detail & Related papers  (2025-11-07T17:09:30Z)
• Quantum process tomography of a compressed time evolution circuit on superconducting quantum processors [0.0]
  We employ state-of-the-art quantum process tomography (QPT) techniques to characterize the noise channels of IBM quantum processors.<n>We find that the compressed circuit systematically yields larger eigenvalue moduli, demonstrating better noise resilience.
  arXiv  Detail & Related papers  (2025-09-29T18:00:51Z)
• Digitized counterdiabatic quantum critical dynamics [32.73124984242397]
  We experimentally demonstrate that a digitized counterdiabatic quantum protocol reduces the number of topological defects created during a fast quench.<n>We utilize superconducting cloud-based quantum processors with up to 156 qubits.
  arXiv  Detail & Related papers  (2025-02-20T23:43:04Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Multi-time quantum process tomography on a superconducting qubit [0.0]
  Current quantum technologies are at the cusp of becoming useful, but still face formidable obstacles such as noise. Noise severely limits the ability to scale quantum devices to the point that they would offer an advantage over classical devices.
  arXiv  Detail & Related papers  (2023-08-01T18:00:02Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• 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)
• Quantum process tomography with unsupervised learning and tensor networks [0.0]
  We present a new technique for performing quantum process tomography. We combine a tensor network representation of the channel with a data-driven optimization inspired by unsupervised machine learning. Our results go far beyond state-of-the-art, providing a practical and timely tool for benchmarking quantum circuits in current and near-term quantum computers.
  arXiv  Detail & Related papers  (2020-06-03T17:54:23Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.