Variational certification of quantum devices

• URL: http://arxiv.org/abs/2011.01879v3
• Date: Thu, 25 Aug 2022 08:43:46 GMT
• Title: Variational certification of quantum devices
• Authors: Akash Kundu, Jaros{\l}aw Adam Miszczak
• Abstract summary: We describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices. We provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: One of the requirements imposed on the realistic quantum computers is to provide computation results which can be repeated and reproduced. In the situation when one needs to repeat the quantum computation procedure several times, it is crucial that the copies of the quantum devices are similar in the sense of the produced results. In this work, we describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices. The procedure is developed by combining Choi-Jamio{\l}kowski isomorphism with the variational hybrid quantum-classical procedure for matrix diagonalization. We compare the introduced procedure with the scheme based on the standard bounds for the similarity between quantum operations by analysing its action on random quantum channels. We also discuss the sensitivity of the described procedure to the noise, and we provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Phase Processing and its Applications in Estimating Phase and Entropies [10.8525801756287]
  "quantum phase processing" can directly apply arbitrary trigonometric transformations to eigenphases of a unitary operator. Quantum phase processing can extract the eigen-information of quantum systems by simply measuring the ancilla qubit. We propose a new quantum phase estimation algorithm without quantum Fourier transform, which requires the fewest ancilla qubits and matches the best performance so far.
  arXiv  Detail & Related papers  (2022-09-28T17:41:19Z)
• Partial Equivalence Checking of Quantum Circuits [23.357645240384876]
  Equivalence checking of quantum circuits is an essential element in quantum program compilation. We devise algorithms for checking quantum circuits whose partial equivalence cannot be verified.
  arXiv  Detail & Related papers  (2022-08-16T06:56:53Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Variational Quantum Anomaly Detection: Unsupervised mapping of phase diagrams on a physical quantum computer [0.0]
  We propose variational quantum anomaly detection, an unsupervised quantum machine learning algorithm to analyze quantum data from quantum simulation. The algorithm is used to extract the phase diagram of a system with no prior physical knowledge. We show that it can be used with readily accessible devices nowadays and perform the algorithm on a real quantum computer.
  arXiv  Detail & Related papers  (2021-06-15T06:54:47Z)
• Implementation of hybridly protected quantum gates [2.3274138116397727]
  We explore the implementation of hybridly protected quantum operations based on a simple and experimentally achievable spin model. The protected quantum operations are controllable, well-suited for resolving various quantum tasks. Our scheme is based on experimentally achievable Hamiltonian with reduced requirement of computational resources.
  arXiv  Detail & Related papers  (2021-05-11T10:04:02Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.