Benchmarking a boson sampler with Hamming nets

• URL: http://arxiv.org/abs/2305.10946v1
• Date: Thu, 18 May 2023 13:07:02 GMT
• Title: Benchmarking a boson sampler with Hamming nets
• Authors: Ilia A. Iakovlev, Oleg M. Sotnikov, Ivan V. Dyakonov, Evgeniy O. Kiktenko, Aleksey K. Fedorov, Stanislav S. Straupe and Vladimir V. Mazurenko
• Abstract summary: We propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.
• Score: 1.0555513406636092
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Analyzing the properties of complex quantum systems is crucial for further development of quantum devices, yet this task is typically challenging and demanding with respect to required amount of measurements. A special attention to this problem appears within the context of characterizing outcomes of noisy intermediate-scale quantum devices, which produce quantum states with specific properties so that it is expected to be hard to simulate such states using classical resources. In this work, we address the problem of characterization of a boson sampling device, which uses interference of input photons to produce samples of non-trivial probability distributions that at certain condition are hard to obtain classically. For realistic experimental conditions the problem is to probe multi-photon interference with a limited number of the measurement outcomes without collisions and repetitions. By constructing networks on the measurements outcomes, we demonstrate a possibility to discriminate between regimes of indistinguishable and distinguishable bosons by quantifying the structures of the corresponding networks. Based on this we propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Notably, the protocol works in the most challenging regimes of having a very limited number of bitstrings without collisions and repetitions. As we expect, our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.

Related papers

• Bounding the Sample Fluctuation for Pure States Certification with Local Random Measurement [4.923287660970805]
  Recent advancements in randomized measurement techniques have provided fresh insights in this area. We investigate the fundamental properties of schemes that certify pure quantum states through random local Haar measurements. Our results unveil the intrinsic interplay between operator complexity and the efficiency of quantum algorithms, serving as an obstacle to local certification of pure states with long-range entanglement.
  arXiv  Detail & Related papers  (2024-10-22T02:26:44Z)
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows [1.412425180760368]
  We propose a robust shallow shadows protocol for characterizing quantum states on current quantum computing platforms. Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity. 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)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• The randomized measurement toolbox [3.2095357952052854]
  We review recently developed protocols for probing the properties of complex many-qubit systems. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis. We discuss a range of use cases that have already been realized in quantum devices.
  arXiv  Detail & Related papers  (2022-03-21T22:33:18Z)
• Noise thresholds for classical simulability of non-linear Boson sampling [4.812718493682455]
  We introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise. Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise.
  arXiv  Detail & Related papers  (2022-02-24T12:17:28Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Importance sampling of randomized measurements for probing entanglement [0.0]
  We show that combining randomized measurement protocols with importance sampling allows for characterizing entanglement in significantly larger quantum systems. A drastic reduction of statistical errors is obtained using machine-learning and tensor networks using partial information on the quantum state.
  arXiv  Detail & Related papers  (2021-02-26T14:55: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.