Automatic quantum circuit encoding of a given arbitrary quantum state

We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state $\vert \Psi \rangle$ onto an optimal quantum circuit $\hat{\mathcal{C}}$ with a finite number of single- and two-qubit quantum gates. The proposed algorithm employs as an objective function the absolute value of fidelity $F = \langle 0 \vert \hat{\mathcal{C}}^{\dagger} \vert \Psi \rangle$, which is maximized iteratively to construct an optimal quantum circuit $\hat{\mathcal{C}}$ with controlled accuracy. The key ingredient of the algorithm is the sequential determination of a set of optimal two-qubit unitary operators one by one via the singular value decomposition of the fidelity tensor. Once the optimal unitary operators are determined, including the location of qubits on which each unitary operator acts, elementary quantum gates are assigned algebraically. With noiseless numerical simulations, we demonstrate the algorithm to encode a ground state of quantum many-body systems, including the spin-1/2 antiferromagnetic Heisenberg model and the spin-1/2 XY model. The results are also compared with the quantum circuit encoding of the same quantum state onto a quantum circuit in a given circuit structure. Moreover, we demonstrate that the algorithm can also be applied to construct an optimal quantum circuit for classical data such as a classical image that is represented as a quantum state by the amplitude encoding. Finally, we also experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
Comment: 25 pages, 14 figures