VQE¶
- class VQE(ansatz=None, optimizer=None, initial_point=None, gradient=None, expectation=None, include_custom=False, max_evals_grouped=1, callback=None, quantum_instance=None)[source]¶
Bases :
VariationalAlgorithm
,MinimumEigensolver
The Variational Quantum Eigensolver algorithm.
VQE is a quantum algorithm that uses a variational technique to find the minimum eigenvalue of the Hamiltonian \(H\) of a given system.
An instance of VQE requires defining two algorithmic sub-components: a trial state (a.k.a. ansatz) which is a
QuantumCircuit
, and one of the classicaloptimizers
. The ansatz is varied, via its set of parameters, by the optimizer, such that it works towards a state, as determined by the parameters applied to the ansatz, that will result in the minimum expectation value being measured of the input operator (Hamiltonian).An optional array of parameter values, via the initial_point, may be provided as the starting point for the search of the minimum eigenvalue. This feature is particularly useful such as when there are reasons to believe that the solution point is close to a particular point. As an example, when building the dissociation profile of a molecule, it is likely that using the previous computed optimal solution as the starting initial point for the next interatomic distance is going to reduce the number of iterations necessary for the variational algorithm to converge. It provides an initial point tutorial detailing this use case.
The length of the initial_point list value must match the number of the parameters expected by the ansatz being used. If the initial_point is left at the default of
None
, then VQE will look to the ansatz for a preferred value, based on its given initial state. If the ansatz returnsNone
, then a random point will be generated within the parameter bounds set, as per above. If the ansatz providesNone
as the lower bound, then VQE will default it to \(-2\pi\); similarly, if the ansatz returnsNone
as the upper bound, the default value will be \(2\pi\).The optimizer can either be one of Qiskit’s optimizers, such as
SPSA
or a callable with the following signature:Note
The callable _must_ have the argument names
fun, x0, jac, bounds
as indicated in the following code block.The above signature also allows to directly pass any SciPy minimizer, for instance as
- Paramètres
ansatz (
Optional
[QuantumCircuit
]) – A parameterized circuit used as Ansatz for the wave function.optimizer (
Union
[Optimizer
,Minimizer
,None
]) – A classical optimizer. Can either be a Qiskit optimizer or a callable that takes an array as input and returns a Qiskit or SciPy optimization result.initial_point (
Optional
[ndarray
]) – An optional initial point (i.e. initial parameter values) for the optimizer. IfNone
then VQE will look to the ansatz for a preferred point and if not will simply compute a random one.gradient (
Union
[GradientBase
,Callable
,None
]) – An optional gradient function or operator for optimizer.expectation (
Optional
[ExpectationBase
]) – The Expectation converter for taking the average value of the Observable over the ansatz state function. WhenNone
(the default) anExpectationFactory
is used to select an appropriate expectation based on the operator and backend. When using Aer qasm_simulator backend, with paulis, it is however much faster to leverage custom Aer function for the computation but, although VQE performs much faster with it, the outcome is ideal, with no shot noise, like using a state vector simulator. If you are just looking for the quickest performance when choosing Aer qasm_simulator and the lack of shot noise is not an issue then set include_custom parameter here toTrue
(defaults toFalse
).include_custom (
bool
) – When expectation parameter here is None setting this toTrue
will allow the factory to include the custom Aer pauli expectation.max_evals_grouped (
int
) – Max number of evaluations performed simultaneously. Signals the given optimizer that more than one set of parameters can be supplied so that potentially the expectation values can be computed in parallel. Typically this is possible when a finite difference gradient is used by the optimizer such that multiple points to compute the gradient can be passed and if computed in parallel improve overall execution time. Deprecated if a gradient operator or function is given.callback (
Optional
[Callable
[[int
,ndarray
,float
,float
],None
]]) – a callback that can access the intermediate data during the optimization. Four parameter values are passed to the callback as follows during each evaluation by the optimizer for its current set of parameters as it works towards the minimum. These are: the evaluation count, the optimizer parameters for the ansatz, the evaluated mean and the evaluated standard deviation.`quantum_instance (
Union
[Backend
,QuantumInstance
,None
]) – Quantum Instance or Backend
Methods
Computes minimum eigenvalue.
Return the circuits used to compute the expectation value.
Generate the ansatz circuit and expectation value measurement, and return their runnable composition.
Returns a function handle to evaluates the energy at given parameters for the ansatz.
Preparing the setting of VQE into a string.
Whether computing the expectation value of auxiliary operators is supported.
Attributes
- ansatz¶
Returns the ansatz.
- Type renvoyé
- callback¶
Returns callback
- Type renvoyé
Optional
[Callable
[[int
,ndarray
,float
,float
],None
]]
- expectation¶
The expectation value algorithm used to construct the expectation measurement from the observable.
- Type renvoyé
Optional
[ExpectationBase
]
- gradient¶
Returns the gradient.
- Type renvoyé
Union
[GradientBase
,Callable
,None
]
- include_custom¶
Returns include_custom
- Type renvoyé
bool
- initial_point¶
Returns initial point
- Type renvoyé
Optional
[ndarray
]
- max_evals_grouped¶
Returns max_evals_grouped
- Type renvoyé
int
- quantum_instance¶
Returns quantum instance.
- Type renvoyé
Optional
[QuantumInstance
]
- setting¶
Prepare the setting of VQE as a string.