New answers tagged

0 votes

Complexity of Variational Quantum Eigensolvers

The decomposition of a Hamiltonian into Pauli strings is not always efficient. The general problem of decomposing a Hamiltonian expressed in an arbitrary basis into Pauli operators can be ...
Bram's user avatar
  • 564
1 vote

D-Wave hybrid solver

As the name suggests, D-Wave's hybrid solvers combine classical solvers with quantum annealers. Generally, a hybrid solver starts by decomposing an optimization problem into smaller pieces, which then ...
MonteNero's user avatar
  • 2,481
1 vote

Minimizing $1 - \text{Tr}(\Phi(\rho,U)^2)$

In your setup, the choice $U={\bf 1}$ of course suffices to minimize your function $$1 - \text{Tr}(\Phi(\rho, U)^2), \tag{1}$$ because we then have $\Phi(\rho, U) = {\rm Tr}_2(\rho) = \overline{\rho}...
Jos Bergervoet's user avatar
0 votes

How can I Combine Qiskit's VQE Tutorial and TSP Simulator to solve the TSP on a real backend efficiently?

If your main task is to run the TSP problem on a real hardware, then you don't have to change much in the original code, but keep in mind that in TSP number of variables increase by the square of ...
Yet another Random Guy's user avatar

Top 50 recent answers are included