Coherent randomized benchmarking

• URL: http://arxiv.org/abs/2010.13810v2
• Date: Sun, 28 Mar 2021 19:16:29 GMT
• Title: Coherent randomized benchmarking
• Authors: Jorge Miguel-Ramiro and Alexander Pirker and Wolfgang D\"ur
• Abstract summary: 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.
• Score: 68.8204255655161
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Randomized benchmarking is a powerful technique to efficiently estimate the performance and reliability of quantum gates, circuits and devices. Here we propose to perform randomized benchmarking in a coherent way, where 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, and in terms of efficiency and scalability. We show that e.g. universal gate sets, the set of $n-$qudit Pauli operators or more general sets including arbitrary unitaries, as well as a particular $n-$qudit Clifford gate using only the Pauli set, can be efficiently benchmarked. The price to pay is an additional complexity to add control to the involved quantum operations. However we demonstrate that this can be done by using auxiliary degrees of freedom that are naturally available in basically any physical realization, and are independent of the gates to be tested.

Related papers

• Restricted Randomized Benchmarking with Universal Gates of Fixed Sequence Length [0.5825410941577593]
  We introduce a version of the RB protocol that creates Haar-randomness using a directly accessible universal gate set of equal sequence length. This makes our protocol highly resource efficient and practical for small qubit numbers.
  arXiv  Detail & Related papers  (2024-05-08T17:07:56Z)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Sampled Transformer for Point Sets [80.66097006145999]
  sparse transformer can reduce the computational complexity of the self-attention layers to $O(n)$, whilst still being a universal approximator of continuous sequence-to-sequence functions. We propose an $O(n)$ complexity sampled transformer that can process point set elements directly without any additional inductive bias.
  arXiv  Detail & Related papers  (2023-02-28T06:38:05Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Scalable fast benchmarking for individual quantum gates with local twirling [1.7995166939620801]
  We propose a character-cycle benchmarking protocol and a character-average benchmarking protocol only using local twirling gates. We numerically demonstrate our protocols for a non-Clifford gate -- controlled-$(TX)$ and a Clifford gate -- five-qubit quantum error-correcting encoding circuit.
  arXiv  Detail & Related papers  (2022-03-19T13:01:14Z)
• A framework for randomized benchmarking over compact groups [0.6091702876917279]
  characterization of experimental systems is an essential step in developing and improving quantum hardware. A collection of protocols known as Randomized Benchmarking (RB) was developed in the past decade, which provides an efficient way to measure error rates in quantum systems. A general framework for RB was proposed, which encompassed most of the known RB protocols and overcame the limitation on error models in previous works. In this work we generalize the RB framework to continuous groups of gates and show that as long as the noise level is reasonably small, the output can be approximated as a linear combination of matrix exponential decays.
  arXiv  Detail & Related papers  (2021-11-19T18:43:47Z)
• A Classically Efficient Quantum Scalable Fermi-Hubbard Benchmark [0.0]
  We propose and implement a practical, application-based benchmark for testbed quantum computing devices. Our protocol calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model. We demonstrate and analyze the benchmark performance on superconducting and ion trap testbed hardware from three hardware vendors and with up to 24 qubits.
  arXiv  Detail & Related papers  (2021-10-29T18:52:46Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)

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.