Efficient distributed inner product estimation via Pauli sampling

• URL: http://arxiv.org/abs/2405.06544v2
• Date: Mon, 19 Aug 2024 14:23:33 GMT
• Title: Efficient distributed inner product estimation via Pauli sampling
• Authors: Marcel Hinsche, Marios Ioannou, Sofiene Jerbi, Lorenzo Leone, Jens Eisert, Jose Carrasco,
• Abstract summary: Cross-platform verification is the task of comparing the output states produced by different physical platforms. We propose a novel protocol for this task based on Pauli sampling.
• Score: 0.39583175274885335
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-platform verification is the task of comparing the output states produced by different physical platforms using solely local quantum operations and classical communication. While protocols have previously been suggested for this task, their exponential sample complexity renders them unpractical even for intermediate-scale quantum systems. In this work, we propose a novel protocol for this task based on Pauli sampling, a subroutine which generates Paulis distributed according to their weight in the expansion of a quantum state in the Pauli basis. We show that our protocols for both Pauli sampling and cross-platform verification are efficient for quantum states with low magic and entanglement (i.e., of the order $O(\log n)$). Conversely, we show super-polynomial lower bounds on the complexity of both tasks for states with $\omega(\log n)$ magic and entanglement. Interestingly, when considering states with real amplitudes the requirements of our protocol for cross-platform verification can be significantly weakened.

Related papers

• 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)
• Cross-Platform Comparison of Arbitrary Quantum Processes [5.082103863450012]
  We present a protocol for comparing the performance of arbitrary quantum processes executed on spatially or temporally disparate quantum platforms. We apply the protocol to compare the performance of five quantum devices from IBM and the "Qianshi" quantum computer from Baidu via the cloud.
  arXiv  Detail & Related papers  (2023-03-24T10:51:11Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• 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)
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers [0.0]
  We prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations. We provide a procedure for determining such a set of minimal register Pauli operations.
  arXiv  Detail & Related papers  (2022-06-27T04:22:30Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum advantages for Pauli channel estimation [2.5496329090462626]
  entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation. We show how to apply the ancilla-assisted estimation protocol to a practical quantum benchmarking task.
  arXiv  Detail & Related papers  (2021-08-19T04:10:28Z)
• Efficient Verification of Boson Sampling Using a Quantum Computer [0.0]
  We use the protocols given in the paper [arXiv:2006.03520] to construct a boson sampling experiment using discrete quantum states on IBM quantum computer. We demonstrate the protocols for single mode fidelity estimation, multi mode fidelity estimation and a verification protocol using IBMQ "athens" chip.
  arXiv  Detail & Related papers  (2021-08-09T11:41:15Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.