Variational quantum eigensolver

Last updated November 13, 2024

In quantum computing, the variational quantum eigensolver (VQE) is a quantum algorithm for quantum chemistry, quantum simulations and optimization problems. It is a hybrid algorithm that uses both classical computers and quantum computers to find the ground state of a given physical system. Given a guess or ansatz, the quantum processor calculates the expectation value of the system with respect to an observable, often the Hamiltonian, and a classical optimizer is used to improve the guess. The algorithm is based on the variational method of quantum mechanics.

It was originally proposed in 2014, with corresponding authors Alberto Peruzzo, Alán Aspuru-Guzik and Jeremy O'Brien.^[a]^[1]^[2] The algorithm has also found applications in quantum machine learning and has been further substantiated by general hybrid algorithms between quantum and classical computers.^[3] It is an example of a noisy intermediate-scale quantum (NISQ) algorithm.

Description

Pauli encoding

The objective of the VQE is to find a set of quantum operations that prepares the lowest energy state (or minima) of a close approximation to some target quantity or observable. While the only strict requirement for the representation of an observable is that it is efficient to estimate its expectation values, it is often simplest if that operator has a compact or simple expression in terms of Pauli operators or tensor products of Pauli operators.

For a fermionic system, it is often most convenient to qubitize: that is to write the many-body Hamiltonian of the system using second quantization, and then use a mapping to write the creation-annihiliation operators in terms of Pauli operators. Common schemes for fermions include Jordan–Wigner transformation, Bravyi–Kitaev transformation, and parity transformation.^[4]^[5]

Once the Hamiltonian ${\hat {H}}$ is written in terms of Pauli operators and irrelevant states are discarded (finite-dimensional space), it would consist of a linear combination of Pauli strings ${\hat {P}}_{i}$ consisting of tensor products of Pauli operators (for example $X\otimes I\otimes Z\otimes X$ ), such that

{\hat {H}}=\sum _{i}\alpha _{i}{\hat {P}}_{i}

,

where $\alpha _{i}$ are numerical coefficients. Based on the coefficients, the number of Pauli strings can be reduced in order to optimize the calculation.^[6]

The VQE can be adapted to other optimization problems by adapting the Hamiltonian to be a cost function.^[7]

Ansatz and initial trial function

The choice of ansatz state depends on the system of interest. In gate-based quantum computing, the ansatz is given by a parametrized quantum circuit, whose parameters can be updated after each run. The ansatz has to be adaptable enough to not miss the desired state. A common method to obtain a valid ansatz is given by the unitary coupled cluster (UCC) framework and its extensions.^[8]

If the ansatz is not chosen adequately the procedure may halt at suboptimal parameters that do not correspond to a minima. In this situation, the algorithm is said to have reached a 'barren plateau'.^[5]

The ansatz can be set to an initial trial function to start the algorithm. For example, for a molecular system, one can use the Hartree–Fock method to provide a starting state that is close to the real ground state.

Another variant of the ansatz circuit is the hardware efficient ansatz, which consists of sequence of 1 qubit rotational gates and 2 qubit entangling gates.^{[ citation needed ]} The number of repetitions of 1-qubit rotational gates and 2-qubit entangling gates is called the depth of the circuit.

Measurement

The expectation value of a given state $|\psi (\theta _{1},\cdots ,\theta _{N})\rangle$ with parameters $\{\theta _{i}\}_{i=1}^{N}$ , has an expectation value of the energy or cost function given by

E(\theta _{1},\cdots ,\theta _{n})=\langle {\hat {H}}\rangle =\sum _{i}\alpha _{i}\langle \psi (\theta _{1},\cdots ,\theta _{N})|{\hat {P}}_{i}|\psi (\theta _{1},\cdots ,\theta _{N})\rangle

so in order to obtain the expectation value of the energy, one can measure the expectation value of each Pauli string (number of counts for a given value over the total number of counts). This step corresponds to measuring each qubit in the axis provided by the Pauli string.^[7] For example, for the string $X\otimes Y\otimes Y$ , the first qubit is to be measured in the x-axis, while the last two are to be measured in the y-axis of the Bloch sphere. If measurement in the z-axis is only possible, then Clifford gates can be used to transform between axes. If two Pauli strings commute, then they can be both measured simultaneously using the same circuit and interpreting the result according to the Pauli algebra.

Variational method and optimization

Given a parametrized ansatz for the ground state eigenstate, with parameters that can be modified, one is sure to find the parametrized state that is closest to the ground state based on the variational method of quantum mechanics. Using classical algorithms in a digital computer, the parameters of the ansatz can be optimized. For this minimization, it is necessary to find the minima of a multivariable function. Classical optimizers using gradient descent can be used for this purpose.^[7]

Formulation

For a given Hamiltonian (H) and a state vector $|\psi \rangle$ if we can vary $|\psi \rangle$ arbitrarily then $\min _{|\psi \rangle }\langle \psi |H|\psi \rangle$ will be the ground state energy and $\operatorname {argmin} _{|\psi \rangle }\langle \psi |H|\psi \rangle$ would be a ground state (assuming no degeneracy). But the above minimization problem over all possible states $|\psi \rangle$ , where state $|\psi \rangle$ is $2^{n}$ dimensional, is impractical. Thus to restrict the search space to a more practical size (eg. poly(n)), we need to restrict the $|\psi \rangle$ to only a subset of possible n-qubit states which is based on conventional physics, chemistry and quantum mechanics knowledge.

Algorithm

The adjoining figure illustrates the high level steps in the VQE algorithm.

The circuit $U({\vec {\theta }})$ controls the subset of possible states that can be created, and the parameter ${\vec {\theta }}$ contains the variational parameters, ${\vec {\theta }}={\begin{pmatrix}\theta _{1}\\\theta _{2}\\\vdots \\\theta _{p}\end{pmatrix}}$ where the number of parameters chosen are enough to lend the algorithm expressive power to compute the ground state of the system, but not too big to increase the computational cost of the optimization step.

By running the circuit many times and constantly updating the parameters to find the global minima of the expectation value of the desired observable, one can approach the ground state of the given system and store it in a quantum processor as a series of quantum gate instructions.

In case of gradient descent, its required to minimize a cost function $f({\vec {\theta }})$ where for the VQE case $f({\vec {\theta }})=\langle \psi ({\vec {\theta }})|H|\psi ({\vec {\theta }})\rangle$ . The update rule is:

{\vec {\theta }}^{({\text{new}})}={\vec {\theta }}^{({\text{old}})}-r\nabla f({\vec {\theta }}^{({\text{old}})})

where r is the learning rate (step size) and

\Delta f({\vec {\theta }}^{({\text{old}})})=\left({\frac {\partial f({\vec {\theta }}^{({\text{old}})})}{\partial \theta _{1}}},{\frac {\partial f({\vec {\theta }}^{({\text{old}})})}{\partial \theta _{2}}},\ldots \right)^{\top }

In order to compute the gradients, the parameter shift rule is used.^[9]^[10]

Example

Considering a single Pauli gate example:

U(\theta )=e^{-i{\frac {\theta }{2}}P},

where P = X,Y or Z, then

\nabla _{\theta }U={\frac {\partial U}{\partial \theta }}=-{\frac {i}{2}}Pe^{-i{\frac {\theta }{2}}P}=-{\frac {i}{2}}PU=-{\frac {i}{2}}UP

As, $f(\theta )=\langle \phi |U^{\dagger }AU|\phi \rangle$ . Thus,

\nabla _{\theta }f(\theta )={\frac {\partial }{\partial \theta }}\langle \phi |U^{\dagger }AU|\phi \rangle =\langle \phi |\left({\frac {i}{2}}P\right)U^{\dagger }AU|\phi \rangle +\langle \phi |U^{\dagger }A\left(-{\frac {i}{2}}P\right)U|\phi \rangle

={\frac {1}{2}}\langle \phi |U^{\dagger }(\theta +{\frac {\pi }{2}})AU(\theta +{\frac {\pi }{2}})|\phi \rangle -{\frac {1}{2}}\langle \phi |U^{\dagger }(\theta -{\frac {\pi }{2}})AU(\theta -{\frac {\pi }{2}})|\phi \rangle

={\frac {1}{2}}\left(f(\theta +{\frac {\pi }{2}})-f(\theta -{\frac {\pi }{2}})\right)

The above result has interesting properties as:

The same circuit can be used to evaluate $f(\theta )$ and $\nabla _{\theta }f(\theta )$
$f(\cdot )$ needs to be evaluated 2 times to arrive at the gradient value
As the angle precision $\pm {\frac {\pi }{2}}$ is large, gate precision can be kept low

Advantages and disadvantages

The VQE circuit does not require many gates compared with quantum phase estimation algorithm (QPE), it is more robust to errors and lends itself well to error mitigation strategies.
It is a heuristic method and thus does not guarantee convergence to the ground state value. The method is highly influenced by the choice of ansatz circuit and the optimization methods.
Number of measurements required to conclude the value of ground state is higher compared to the QPE and scales approximately with the number of terms in the Hamiltonian.
VQE can run on NISQ hardware.
VQE is highly versatile, as problems (apart from chemistry) can be expressed as Hamiltonians.

Use

In chemistry

As of 2022, the variational quantum eigensolver can only simulate small molecules like the helium hydride ion ^[1] or the beryllium hydride molecule.^[11] Larger molecules can be simulated by taking into account symmetry considerations. In 2020, a 12-qubit simulation of a hydrogen chain (H₁₂) was demonstrated using Google's Sycamore quantum processor.^[12]

Notes

↑ Full authors: Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alan Aspuru-Guzik and Jeremy L. O’Brien. All equally contributing.

Related Research Articles

Quantum superposition is a fundamental principle of quantum mechanics that states that linear combinations of solutions to the Schrödinger equation are also solutions of the Schrödinger equation. This follows from the fact that the Schrödinger equation is a linear differential equation in time and position. More precisely, the state of a system is given by a linear combination of all the eigenfunctions of the Schrödinger equation governing that system.

Quantum decoherence is the loss of quantum coherence. Quantum decoherence has been studied to understand how quantum systems convert to systems which can be explained by classical mechanics. Beginning out of attempts to extend the understanding of quantum mechanics, the theory has developed in several directions and experimental studies have confirmed some of the key issues. Quantum computing relies on quantum coherence and is one of the primary practical applications of the concept.

In physics, the Rabi cycle is the cyclic behaviour of a two-level quantum system in the presence of an oscillatory driving field. A great variety of physical processes belonging to the areas of quantum computing, condensed matter, atomic and molecular physics, and nuclear and particle physics can be conveniently studied in terms of two-level quantum mechanical systems, and exhibit Rabi flopping when coupled to an optical driving field. The effect is important in quantum optics, magnetic resonance and quantum computing, and is named after Isidor Isaac Rabi.

In quantum mechanics and computing, the Bloch sphere is a geometrical representation of the pure state space of a two-level quantum mechanical system (qubit), named after the physicist Felix Bloch.

In quantum computing and specifically the quantum circuit model of computation, a quantum logic gate is a basic quantum circuit operating on a small number of qubits. Quantum logic gates are the building blocks of quantum circuits, like classical logic gates are for conventional digital circuits.

The Stokes parameters are a set of values that describe the polarization state of electromagnetic radiation. They were defined by George Gabriel Stokes in 1852, as a mathematically convenient alternative to the more common description of incoherent or partially polarized radiation in terms of its total intensity (I), (fractional) degree of polarization (p), and the shape parameters of the polarization ellipse. The effect of an optical system on the polarization of light can be determined by constructing the Stokes vector for the input light and applying Mueller calculus, to obtain the Stokes vector of the light leaving the system. They can be determined from directly observable phenomena. The original Stokes paper was discovered independently by Francis Perrin in 1942 and by Subrahamanyan Chandrasekhar in 1947, who named it as the Stokes parameters.

The Ehrenfest theorem, named after Austrian theoretical physicist Paul Ehrenfest, relates the time derivative of the expectation values of the position and momentum operators x and p to the expectation value of the force $on a massive particle moving in a scalar potential,$

In mathematical physics, some approaches to quantum field theory are more popular than others. For historical reasons, the Schrödinger representation is less favored than Fock space methods. In the early days of quantum field theory, maintaining symmetries such as Lorentz invariance, displaying them manifestly, and proving renormalisation were of paramount importance. The Schrödinger representation is not manifestly Lorentz invariant and its renormalisability was only shown as recently as the 1980s by Kurt Symanzik (1981).

The time-evolving block decimation (TEBD) algorithm is a numerical scheme used to simulate one-dimensional quantum many-body systems, characterized by at most nearest-neighbour interactions. It is dubbed Time-evolving Block Decimation because it dynamically identifies the relevant low-dimensional Hilbert subspaces of an exponentially larger original Hilbert space. The algorithm, based on the Matrix Product States formalism, is highly efficient when the amount of entanglement in the system is limited, a requirement fulfilled by a large class of quantum many-body systems in one dimension.

<span class="mw-page-title-main">One-way quantum computer</span> Method of quantum computing

The one-way quantum computer, also known as measurement-based quantum computer (MBQC), is a method of quantum computing that first prepares an entangled resource state, usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-way" because the resource state is destroyed by the measurements.

Entanglement distillation is the transformation of N copies of an arbitrary entangled state $into some number of approximately pure Bell pairs, using only local operations and classical communication.$

In quantum computing, the quantum phase estimation algorithm is a quantum algorithm to estimate the phase corresponding to an eigenvalue of a given unitary operator. Because the eigenvalues of a unitary operator always have unit modulus, they are characterized by their phase, and therefore the algorithm can be equivalently described as retrieving either the phase or the eigenvalue itself. The algorithm was initially introduced by Alexei Kitaev in 1995.

In physics, Berry connection and Berry curvature are related concepts which can be viewed, respectively, as a local gauge potential and gauge field associated with the Berry phase or geometric phase. The concept was first introduced by S. Pancharatnam as geometric phase and later elaborately explained and popularized by Michael Berry in a paper published in 1984 emphasizing how geometric phases provide a powerful unifying concept in several branches of classical and quantum physics.

In quantum mechanics, the variational method is one way of finding approximations to the lowest energy eigenstate or ground state, and some excited states. This allows calculating approximate wavefunctions such as molecular orbitals. The basis for this method is the variational principle.

In pure and applied mathematics, quantum mechanics and computer graphics, a tensor operator generalizes the notion of operators which are scalars and vectors. A special class of these are spherical tensor operators which apply the notion of the spherical basis and spherical harmonics. The spherical basis closely relates to the description of angular momentum in quantum mechanics and spherical harmonic functions. The coordinate-free generalization of a tensor operator is known as a representation operator.

The Peierls substitution method, named after the original work by Rudolf Peierls is a widely employed approximation for describing tightly-bound electrons in the presence of a slowly varying magnetic vector potential.

In quantum computation, the Hadamard test is a method used to create a random variable whose expected value is the expected real part $, where is a quantum state and is a unitary gate acting on the space of . The Hadamard test produces a random variable whose image is in and whose expected value is exactly . It is possible to modify the circuit to produce a random variable whose expected value is by applying an gate after the first Hadamard gate.$

<span class="mw-page-title-main">Swap test</span> Technique for comparing quantum states

The swap test is a procedure in quantum computation that is used to check how much two quantum states differ, appearing first in the work of Barenco et al. and later rediscovered by Harry Buhrman, Richard Cleve, John Watrous, and Ronald de Wolf. It appears commonly in quantum machine learning, and is a circuit used for proofs-of-concept in implementations of quantum computers.

The quantum Fisher information is a central quantity in quantum metrology and is the quantum analogue of the classical Fisher information. It is one of the central quantities used to qualify the utility of an input state, especially in Mach–Zehnder interferometer-based phase or parameter estimation. It is shown that the quantum Fisher information can also be a sensitive probe of a quantum phase transition. The quantum Fisher information $of a state with respect to the observable is defined as$

Quantum computational chemistry is an emerging field that exploits quantum computing to simulate chemical systems. Despite quantum mechanics' foundational role in understanding chemical behaviors, traditional computational approaches face significant challenges, largely due to the complexity and computational intensity of quantum mechanical equations. This complexity arises from the exponential growth of a quantum system's wave function with each added particle, making exact simulations on classical computers inefficient.

References

1 2 Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alán; O’Brien, Jeremy L. (2014). "A variational eigenvalue solver on a photonic quantum processor". Nature Communications. 5 (1): 4213. arXiv: 1304.3061 . Bibcode:2014NatCo...5.4213P. doi:10.1038/ncomms5213. ISSN 2041-1723. PMC 4124861 . PMID 25055053.
↑ Bharti, Kishor; Cervera-Lierta, Alba; Kyaw, Thi Ha; Haug, Tobias; Alperin-Lea, Sumner; Anand, Abhinav; Degroote, Matthias; Heimonen, Hermanni; Kottmann, Jakob S.; Menke, Tim; Mok, Wai-Keong; Sim, Sukin; Kwek, Leong-Chuan; Aspuru-Guzik, Alán (2022-02-15). "Noisy intermediate-scale quantum algorithms". Reviews of Modern Physics. 94 (1): 015004. arXiv: 2101.08448 . Bibcode:2022RvMP...94a5004B. doi:10.1103/RevModPhys.94.015004. hdl: 10356/161272 .
↑ McClean, Jarrod R; Romero, Jonathan; Babbush, Ryan; Aspuru-Guzik, Alán (2016-02-04). "The theory of variational hybrid quantum-classical algorithms". New Journal of Physics. 18 (2): 023023. arXiv: 1509.04279 . Bibcode:2016NJPh...18b3023M. doi: 10.1088/1367-2630/18/2/023023 . ISSN 1367-2630. S2CID 92988541.
↑ Steudtner, M (2019). Methods to simulate fermions on quantum computers with hardware limitations (PhD Thesis). University of Leiden.
1 2 Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard; Rungger, Ivan; Booth, George H.; Tennyson, Jonathan (2022-06-12). "The Variational Quantum Eigensolver: A review of methods and best practices". Physics Reports. 986: 1–128. arXiv: 2111.05176 . Bibcode:2022PhR...986....1T. doi:10.1016/j.physrep.2022.08.003. S2CID 243861087.
↑ Seeley, Jacob T.; Richard, Martin J.; Love, Peter J. (2012-12-12). "The Bravyi-Kitaev transformation for quantum computation of electronic structure". The Journal of Chemical Physics. 137 (22): 224109. arXiv: 1208.5986 . Bibcode:2012JChPh.137v4109S. doi:10.1063/1.4768229. ISSN 0021-9606. PMID 23248989. S2CID 30699239.
1 2 3 Moll, Nikolaj; Barkoutsos, Panagiotis; Bishop, Lev S; Chow, Jerry M; Cross, Andrew; Egger, Daniel J; Filipp, Stefan; Fuhrer, Andreas; Gambetta, Jay M; Ganzhorn, Marc; Kandala, Abhinav; Mezzacapo, Antonio; Müller, Peter; Riess, Walter; Salis, Gian (2018). "Quantum optimization using variational algorithms on near-term quantum devices". Quantum Science and Technology. 3 (3): 030503. arXiv: 1710.01022 . Bibcode:2018QS&T....3c0503M. doi:10.1088/2058-9565/aab822. ISSN 2058-9565. S2CID 56376912.
↑ Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard; Rungger, Ivan; Booth, George H.; Tennyson, Jonathan (2022-06-12). "The Variational Quantum Eigensolver: A review of methods and best practices". Physics Reports. 986: 1–128. arXiv: 2111.05176 . Bibcode:2022PhR...986....1T. doi:10.1016/j.physrep.2022.08.003. S2CID 243861087.
↑ Wierichs, David; Izaac, Josh; Wang, Cody; Lin, Cedric Yen-Yu (2022-01-01). "General parameter-shift rules for quantum gradients". Quantum. 6: 677. doi:10.22331/q-2022-03-30-677.
↑ Markovich, Liubov; Malikis, Savvas; Polla, Stefano; Tura, Jordi (2024-06-01). "Parameter shift rule with optimal phase selection". Physical Review A. 109 (6). APS: 062429. doi:10.1103/PhysRevA.109.062429.
↑ Kandala, Abhinav; Mezzacapo, Antonio; Temme, Kristan; Takita, Maika; Brink, Markus; Chow, Jerry M.; Gambetta, Jay M. (2017). "Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets". Nature. 549 (7671): 242–246. arXiv: 1704.05018 . Bibcode:2017Natur.549..242K. doi:10.1038/nature23879. ISSN 1476-4687. PMID 28905916. S2CID 4390182.
↑ Arute, Frank; Arya, Kunal; Babbush, Ryan; et al. (2020). "Hartree-Fock on a superconducting qubit quantum computer". Science. 369 (6507): 1084–1089. arXiv: 2004.04174 . Bibcode:2020Sci...369.1084.. doi:10.1126/science.abb9811. ISSN 0036-8075. PMID 32855334. S2CID 215548188.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Full authors: Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, Man-Hong Yung, Xiao-Qi Zhou, Peter J. Love, Alan Aspuru-Guzik and Jeremy L. O’Brien. All equally contributing.

[:1-2] 1 2 Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alán; O’Brien, Jeremy L. (2014). "A variational eigenvalue solver on a photonic quantum processor". Nature Communications. 5 (1): 4213. arXiv: 1304.3061 . Bibcode:2014NatCo...5.4213P. doi:10.1038/ncomms5213. ISSN 2041-1723. PMC 4124861 . PMID 25055053.

[3] Bharti, Kishor; Cervera-Lierta, Alba; Kyaw, Thi Ha; Haug, Tobias; Alperin-Lea, Sumner; Anand, Abhinav; Degroote, Matthias; Heimonen, Hermanni; Kottmann, Jakob S.; Menke, Tim; Mok, Wai-Keong; Sim, Sukin; Kwek, Leong-Chuan; Aspuru-Guzik, Alán (2022-02-15). "Noisy intermediate-scale quantum algorithms". Reviews of Modern Physics. 94 (1): 015004. arXiv: 2101.08448 . Bibcode:2022RvMP...94a5004B. doi:10.1103/RevModPhys.94.015004. hdl: 10356/161272 .

[4] McClean, Jarrod R; Romero, Jonathan; Babbush, Ryan; Aspuru-Guzik, Alán (2016-02-04). "The theory of variational hybrid quantum-classical algorithms". New Journal of Physics. 18 (2): 023023. arXiv: 1509.04279 . Bibcode:2016NJPh...18b3023M. doi: 10.1088/1367-2630/18/2/023023 . ISSN 1367-2630. S2CID 92988541.

[5] Steudtner, M (2019). Methods to simulate fermions on quantum computers with hardware limitations (PhD Thesis). University of Leiden.

[:2-6] 1 2 Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard; Rungger, Ivan; Booth, George H.; Tennyson, Jonathan (2022-06-12). "The Variational Quantum Eigensolver: A review of methods and best practices". Physics Reports. 986: 1–128. arXiv: 2111.05176 . Bibcode:2022PhR...986....1T. doi:10.1016/j.physrep.2022.08.003. S2CID 243861087.

[7] Seeley, Jacob T.; Richard, Martin J.; Love, Peter J. (2012-12-12). "The Bravyi-Kitaev transformation for quantum computation of electronic structure". The Journal of Chemical Physics. 137 (22): 224109. arXiv: 1208.5986 . Bibcode:2012JChPh.137v4109S. doi:10.1063/1.4768229. ISSN 0021-9606. PMID 23248989. S2CID 30699239.

[:0-8] 1 2 3 Moll, Nikolaj; Barkoutsos, Panagiotis; Bishop, Lev S; Chow, Jerry M; Cross, Andrew; Egger, Daniel J; Filipp, Stefan; Fuhrer, Andreas; Gambetta, Jay M; Ganzhorn, Marc; Kandala, Abhinav; Mezzacapo, Antonio; Müller, Peter; Riess, Walter; Salis, Gian (2018). "Quantum optimization using variational algorithms on near-term quantum devices". Quantum Science and Technology. 3 (3): 030503. arXiv: 1710.01022 . Bibcode:2018QS&T....3c0503M. doi:10.1088/2058-9565/aab822. ISSN 2058-9565. S2CID 56376912.

[9] Tilly, Jules; Chen, Hongxiang; Cao, Shuxiang; Picozzi, Dario; Setia, Kanav; Li, Ying; Grant, Edward; Wossnig, Leonard; Rungger, Ivan; Booth, George H.; Tennyson, Jonathan (2022-06-12). "The Variational Quantum Eigensolver: A review of methods and best practices". Physics Reports. 986: 1–128. arXiv: 2111.05176 . Bibcode:2022PhR...986....1T. doi:10.1016/j.physrep.2022.08.003. S2CID 243861087.

[10] Wierichs, David; Izaac, Josh; Wang, Cody; Lin, Cedric Yen-Yu (2022-01-01). "General parameter-shift rules for quantum gradients". Quantum. 6: 677. doi:10.22331/q-2022-03-30-677.

[11] Markovich, Liubov; Malikis, Savvas; Polla, Stefano; Tura, Jordi (2024-06-01). "Parameter shift rule with optimal phase selection". Physical Review A. 109 (6). APS: 062429. doi:10.1103/PhysRevA.109.062429.

[12] Kandala, Abhinav; Mezzacapo, Antonio; Temme, Kristan; Takita, Maika; Brink, Markus; Chow, Jerry M.; Gambetta, Jay M. (2017). "Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets". Nature. 549 (7671): 242–246. arXiv: 1704.05018 . Bibcode:2017Natur.549..242K. doi:10.1038/nature23879. ISSN 1476-4687. PMID 28905916. S2CID 4390182.

[13] Arute, Frank; Arya, Kunal; Babbush, Ryan; et al. (2020). "Hartree-Fock on a superconducting qubit quantum computer". Science. 369 (6507): 1084–1089. arXiv: 2004.04174 . Bibcode:2020Sci...369.1084.. doi:10.1126/science.abb9811. ISSN 0036-8075. PMID 32855334. S2CID 215548188.

[a]

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]