Experimental Efficient Influence Sampling of Quantum Processes

• URL: http://arxiv.org/abs/2506.07103v1
• Date: Sun, 08 Jun 2025 12:15:04 GMT
• Title: Experimental Efficient Influence Sampling of Quantum Processes
• Authors: Hao Zhan, Zongbo Bao, Zekun Ye, Qianyi Wang, Minghao Mi, Penghui Yao, Lijian Zhang,
• Abstract summary: Characterizing quantum processes paves the way for unlocking the full potential of quantum systems.<n>We introduce influence sampling that efficiently extracts the key textitinfluence of a quantum process on qubit subsets.<n>Using a photonic platform, we experimentally demonstrate influence sampling and apply it to testing and learning quantum junta processes.
• Score: 3.3819025097691537
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Characterizing quantum processes paves the way for unlocking the full potential of quantum systems. However, quantum process tomography demands intensive resources and becomes infeasible on large-scale quantum devices. Other methods have explored advanced strategies, yet challenges in experimental feasibility and scalability persist. To address this issues, we introduce influence sampling that efficiently extracts the key \textit{influence} of a quantum process on qubit subsets using at most three distinct single-qubit test gates. Using a photonic platform, we experimentally demonstrate influence sampling and apply it to testing and learning quantum junta processes, determining whether a process acts non-trivially on only a subset of qubits and subsequently learning that process. In addition, we confirm the scalability of influence sampling by deploying it in larger systems. These results establish influence sampling as a powerful and scalable process characterization technique, facilitating efficient device assessment and noisy qubit identification.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• 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)
• Multimodal deep representation learning for quantum cross-platform verification [60.01590250213637]
  Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms. We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities. We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
  arXiv  Detail & Related papers  (2023-11-07T04:35:03Z)
• Simulating Gaussian boson sampling quantum computers [68.8204255655161]
  We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks. We focus mostly on methods that use phase-space representations of quantum mechanics. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
  arXiv  Detail & Related papers  (2023-08-02T02:03:31Z)
• Verifiable measurement-based quantum random sampling with trapped ions [0.7978498178655667]
  Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage is through quantum random sampling performed on quantum computing devices. Here, we experimentally demonstrate efficiently verifiable quantum random sampling in the measurement-based model of quantum computation.
  arXiv  Detail & Related papers  (2023-07-26T18:00:03Z)
• Quantum correlation generation capability of experimental processes [5.552315676636436]
  EPR steering and Bell nonlocality illustrate two different kinds of correlations predicted by quantum mechanics. We show that the capability of an experimental process to create quantum correlations can be quantified. We demonstrate this utility by examining the experimental capability of creating quantum correlations with the controlled-phase operations on the IBM Quantum Experience and Amazon Braket Rigetti superconducting quantum computers.
  arXiv  Detail & Related papers  (2023-04-30T02:22:56Z)
• Quantifying the Expressive Capacity of Quantum Systems: Fundamental Limits and Eigentasks [0.0]
  expressive capacity of quantum systems for machine learning is limited by quantum sampling noise incurred during measurement. We present a mathematical framework for evaluating the available expressive capacity of general quantum systems from a finite number of measurements. We show that extracting low-noise eigentasks leads to improved performance for machine learning tasks such as classification, displaying robustness to overfitting.
  arXiv  Detail & Related papers  (2022-12-30T20:15:31Z)
• 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)
• Parameterized process characterization with reduced resource requirements [0.5735035463793008]
  This work proposes an alternative approach that requires significantly fewer resources for unitary process characterization without prior knowledge of the process. By measuring the quantum process as rotated through the X and Y axes on the Sphere Bloch, we can acquire enough information to reconstruct the quantum process matrix $chi$ and measure its fidelity. We demonstrate in numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.
  arXiv  Detail & Related papers  (2021-09-22T17:41:32Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Experimental statistical signature of many-body quantum interference [0.1376305268426979]
  We experimentally identify genuine many-body quantum interference via a recent efficient protocol. We show how such tools help to identify the - a priori unknown - optimal features to witness these signatures. Our results provide evidence on the efficacy and feasibility of the method, paving the way for its adoption in large-scale implementations.
  arXiv  Detail & Related papers  (2021-03-30T15:17:05Z)
• 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)

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.