arXiv subjects

Dominik Janzing

Publications and source records attributed to Dominik Janzing.

132 records · Page 8Linked to original sources

arXiv2001

Quantum control without access to the controlling interaction

In our model a fixed Hamiltonian acts on the joint Hilbert space of a quantum system and its controller. We show under which conditions measurements, state preparations, and unitary implementations on the system can be performed by quantum operations on the controller only. It turns out that a measurement of the observable A and an implementation of the one-parameter group exp(iAr) can be performed by almost the same sequence of control operations. Furthermore measurement procedures for A+B, for (AB+BA), and for i[A,B] can be constructed from measurements of A and B. This shows that the algebraic structure of the set of observables can be explained by the Lie group structure of the unitary evolutions on the joint Hilbert space of the measuring device and the measured system. A spin chain model with nearest neighborhood coupling shows that the border line between controller and system can be shifted consistently.

quant-ph↗

arXiv2001

Distinguishing n Hamiltonians on C^n by a single measurement

If an experimentalist wants to decide which one of n possible Hamiltonians acting on an n dimensional Hilbert space is present, he can conjugate the time evolution by an appropriate sequence of known unitary transformations in such a way that the different Hamiltonians result in mutual orthogonal final states. We present a general scheme providing such a sequence.

quant-ph↗

arXiv2000

A Complexity Measure for Continuous Time Quantum Algorithms

We consider unitary dynamical evolutions on n qubits caused by time dependent pair-interaction Hamiltonians and show that the running time of a parallelized two-qubit gate network simulating the evolution is given by the time integral over the chromatic index of the interaction graph. This defines a complexity measure of continuous and discrete quantum algorithms which are in exact one-to-one correspondence. Furthermore we prove a lower bound on the growth of large-scale entanglement depending on the chromatic index.

quant-ph↗

arXiv2000

Remark on multi-particle observables and entangled states with constant complexity

We show that every density matrix of an n-particle system prepared by a quantum network of constant depth is asymptotically commuting with the mean-field observables. We introduce certain pairs of hypersurfaces in the space of density matrices and give lower bounds for the depth of a network which prepares states lying outside those pairs. The measurement of an observable which is not asymptotically commuting with the mean-field observables requires a network of depth in the order of log n, if one demands the measurement to project the state into the eigenspace of the measured observable.

quant-ph↗

arXiv2000

The thermodynamic cost of reliability and low temperatures: Tightening Landauer's principle and the Second Law

Landauer's principle states that the erasure of one bit of information requires the free energy kT ln 2. We argue that the reliability of the bit erasure process is bounded by the accuracy inherent in the statistical state of the energy source (`the resources') driving the process. We develop a general framework describing the `thermodynamic worth' of the resources with respect to reliable bit erasure or good cooling. This worth turns out to be given by the distinguishability of the resource's state from its equilibrium state in the sense of a statistical inference problem. Accordingly, Kullback-Leibler relative information is a decisive quantity for the `worth' of the resource's state. Due to the asymmetry of relative information, the reliability of the erasure process is bounded rather by the relative information of the equilibrium state wit respect to the actual state than by the relative information of the actual state with respect to the equilibrium state (which is the free energy up to constants).

quant-ph↗

arXiv1999

Fragility of a class of highly entangled states of many quantum-bits

We consider a Quantum Computer with n quantum-bits (`qubits'), where each qubit is coupled independently to an environment affecting the state in a dephasing or depolarizing way. For mixed states we suggest a quantification for the property of showing {\it quantum} uncertainty on the macroscopic level. We illustrate in which sense a large parameter can be seen as an indicator for large entanglement and give hypersurfaces enclosing the set of separable states. Using methods of the classical theory of maximum likelihood estimation we prove that this parameter is decreasing with 1/\sqrt{n} for all those states which have been exposed to the environment. Furthermore we consider a Quantum Computer with perfect 1-qubit gates and 2-qubit gates with depolarizing error and show that any state which can be obtained from a separable initial state lies inbetween a family of pairs of certain hypersurfaces parallel to those enclosing the separable ones.

quant-ph↗