Quantum algorithmic differentiation

@article{Colucci2021QuantumAD,
  title={Quantum algorithmic differentiation},
  author={Giuseppe Colucci and Francesco Giacosa},
  journal={Quantum Inf. Comput.},
  year={2021},
  volume={21},
  pages={80-94}
}
In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a… 

Figures from this paper

References

SHOWING 1-10 OF 29 REFERENCES

Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits

We develop a method for approximate synthesis of single--qubit rotations of the form $e^{-i f(\phi_1,\ldots,\phi_k)X}$ that is based on the Repeat-Until-Success (RUS) framework for quantum circuit

Efficient networks for quantum factoring.

The number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor are estimated.

Quantum Algorithms for Scientific Computing and Approximate Optimization

The performance of the quantum approximate optimization algorithm (QAOA) is studied, and a generalization of QAOA is shown, particularly suitable for constrained optimization problems and low-resource implementations on near-term quantum devices.

Evaluating analytic gradients on quantum hardware

This paper shows how gradients of expectation values of quantum measurements can be estimated using the same, or almost the same the architecture that executes the original circuit, and proposes recipes for the computation of gradients for continuous-variable circuits.

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that

Quantum algorithms and circuits for scientific computing

This work presents quantum algorithms and circuits for computing the square root, the natural logarithm, and arbitrary fractional powers, and provides performance guarantees in terms of their worst-case accuracy and cost.

Quantum Algorithms for Portfolio Optimization

This work develops the first quantum algorithm for the constrained portfolio optimization problem and provides some experiments to bound the problem-dependent factors arising in the running time of the quantum algorithm, suggesting that for most instances the quantum algorithms can potentially achieve an O(n) speedup over its classical counterpart.

Quantum algorithm and circuit design solving the Poisson equation

A quantum algorithm and a scalable quantum circuit design which approximates the solution of the Poisson equation on a grid with error ε and produces a quantum state encoding the solution.

Calculating energy derivatives for quantum chemistry on a quantum computer

Modeling chemical reactions and complicated molecular systems has been proposed as the “killer application” of a future quantum computer. Accurate calculations of derivatives of molecular