5 research outputs found
Optimal phase estimation in quantum networks
We address the problem of estimating the phase phi given N copies of the
phase rotation u(phi) within an array of quantum operations in finite
dimensions. We first consider the special case where the array consists of an
arbitrary input state followed by any arrangement of the N phase rotations, and
ending with a POVM. We optimise the POVM for a given input state and fixed
arrangement. Then we also optimise the input state for some specific cost
functions. In all cases, the optimal POVM is equivalent to a quantum Fourier
transform in an appropriate basis. Examples and applications are given.Comment: 9 pages, 2 figures; this is an extended version of
arXiv:quant-ph/0609160. v2: minor corrections in reference
Lower bounds on the complexity of simulating quantum gates
We give a simple proof of a formula for the minimal time required to simulate
a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with
fast local unitaries. We also note that a related lower bound holds for
arbitrary n-qubit gates.Comment: 6 page