Analyzing the performance of variational quantum factoring on a superconducting quantum processor

  title={Analyzing the performance of variational quantum factoring on a superconducting quantum processor},
  author={Amir H. Karamlou and William Andrew Simon and Amara Katabarwa and Travis L. Scholten and Borja Peropadre and Yudong Cao},
  journal={npj Quantum Information},
In the near-term, hybrid quantum-classical algorithms hold great potential for outperforming classical approaches. Understanding how these two computing paradigms work in tandem is critical for identifying areas where such hybrid algorithms could provide a quantum advantage. In this work, we study a QAOA-based quantum optimization approach by implementing the Variational Quantum Factoring (VQF) algorithm. We execute experimental demonstrations using a superconducting quantum processor, and… 

Factoring integers with sublinear resources on a superconducting quantum processor

This paper presents a probabilistic simulation of the response of the immune system to quantum fluctuations in a low-dimensional environment.

SoK: Benchmarking the Performance of a Quantum Computer

This paper reviews the existing performance benchmarking protocols, models, and metrics of the quantum computer, and classifies the benchmarking techniques into three categories: physical benchmarking, aggregative benchmarked, and application-level benchmarking.

NISQ computing: where are we and where do we go?

This short review article describes how the Noisy Intermediate Scale Quantum era of quantum computing is increasingly seen to be a distinct phase in the development of quantum computers, heralding an era where the authors have quantum computers that are capable of doing certain quantum computations in a limited fashion, and subject to certain constraints and noise.

Squeezing and quantum approximate optimization

Variational quantum algorithms o ff er fascinating prospects for the solution of combinatorial optimization problems using digital quantum computers. However, the achievable performance in such

General Hamiltonian Representation of ML Detection Relying on the Quantum Approximate Optimization Algorithm

The maximum likelihood (ML) detection problem for general constellations is solved by appropriately adapting the QAOA, which gives rise to a new paradigm in communication systems.

Practical Solving of Discrete Logarithm Problem over Prime Fields Using Quantum Annealing

This paper investigates how to reduce discrete logarithm problem over prime fields to the QUBO problem to obtain as few logical qubits as possible. We show different methods of reduction of discrete

Scalable Method for Eliminating Residual ZZ Interaction between Superconducting Qubits.

Unwanted ZZ interaction is a quantum-mechanical crosstalk phenomenon which correlates qubit dynamics and is ubiquitous in superconducting qubit systems. It adversely affects the quality of quantum

Classically efficient quantum scalable Fermi-Hubbard benchmark

This work proposes and implements a practical, application-based benchmark that calculates the energy of the ground state in the single particle subspace of a 1-D Fermi Hubbard model, a problem which is efficient to solve classically.

Multi-angle quantum approximate optimization algorithm

This work investigates a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters, and finds that good parameters can be found in polynomial time for a test dataset the authors consider.

Quantum transport and localization in 1d and 2d tight-binding lattices

This research presents a probabilistic model for estimating the response of the immune system to laser-spot assisted, 3D image analysis.



and s

Quantum computational advantage using photons

Gaussian boson sampling was performed by sending 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer with full connectivity and random matrix and sampling the output using 100 high-efficiency single-photon detectors, and the obtained samples were validated against plausible hypotheses exploiting thermal states, distinguishable photons, and uniform distribution.

Reducing Unitary and Spectator Errors in Cross Resonance with Optimized Rotary Echoes

We present an improvement to the cross resonance gate realized with the addition of resonant, target rotary pulses. These pulses, applied directly to the target qubit, are simultaneous to and in

Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets

It is demonstrated that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers by implementing a continuous hardware-efficient gate set using superconducting quantum circuits.

Quantum approximate optimization of non-planar graph problems on a planar superconducting processor

The application of the Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems with the quantum approximate optimization algorithm (QAOA) is demonstrated and an approximation ratio is obtained that is independent of problem size and for the first time, that performance increases with circuit depth.

Hartree-Fock on a superconducting qubit quantum computer

Several quantum simulations of chemistry with up to one dozen qubits are performed, including modeling the isomerization mechanism of diazene, and error-mitigation strategies based on N-representability that dramatically improve the effective fidelity of the experiments are demonstrated.

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum‐Classical Algorithms

It is investigated how expressibility “saturates” with increased circuit depth, finding that the rate and saturated value appear to be distinguishing features of a PQC, and methods and results can be useful for algorithm development and design of experiments.

A quantum engineer's guide to superconducting qubits

The aim of this review is to provide quantum engineers with an introductory guide to the central concepts and challenges in the rapidly accelerating field of superconducting quantum circuits. Over

A generative modeling approach for benchmarking and training shallow quantum circuits

A quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks is proposed and it is demonstrated that this approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states.