Related papers: State complexity and phase identification in adapt…
The geometric measure of entanglement of variational quantum states is studied on the basis of its relation with the mean value of spin. We examine n-qubit quantum states prepared by a variational circuit with a layer formed by the…
While quantum state tomography is notoriously hard, most states hold little interest to practically-minded tomographers. Given that states and unitaries appearing in Nature are of bounded gate complexity, it is natural to ask if efficient…
The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by…
Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications. The shallowest circuit depth needed to prepare Slater…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…
It has been shown that the entanglement between the system and ancillary states is not a strict requirement for performing ancilla-assisted process tomography(AAPT). Instead, from a theoretical point of view, it only requires that the…
We study the sensitivity of phase estimation using a generic class of path-symmetric entangled states $|\varphi\rangle|0\rangle+|0\rangle|\varphi\rangle$, where an arbitrary state $|\varphi\rangle$ occupies one of two modes in quantum…
We study multi-qubit variational quantum states that can be considered as vertex- and edge-weighted graph. These states are constructed as single-layer variational circuits with $RX$ rotations and $RZZ$ entangling gates, corresponding to…
Interacting with a standard computer can enhance the capabilities of current quantum computers already today, particularly by offloading certain computations to the standard computer. Quantum computers that interact with standard computers…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…
Entanglement is one of the key resources required for quantum computation, so experimentally creating and measuring entangled states is of crucial importance in the various physical implementations of a quantum computer. In superconducting…
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and spacetime allocation (a…
We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We…
In this work, we investigate the trade-off between the circuit depth and the number of ancillary qubits for preparing sparse quantum states. We prove that any $n$-qubit $d$-spare quantum state (i.e., it has only $d$ non-zero amplitudes) can…
We present a quantum-classical hybrid algorithm for calculating the ground state and its energy of the quantum many-body Hamiltonian by proposing an adaptive construction of a quantum state for the quantum-selected configuration interaction…
This work is originally a Cambridge Part III essay paper. Quantum complexity arises as an alternative measure to the Fubini metric between two quantum states. Given two states and a set of allowed gates, it is defined as the least complex…
We consider to treat the usual probabilistic cloning, state separation, unambiguous state discrimination, \emph{etc} in a uniform framework. All these transformations can be regarded as special examples of generalized completely positive…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…