Publications of Dominik Janzing until 2007

Diploma thesis


D. Janzing. Spektroskopie elastisch gestreuter Ionen an strukturierten
Oberflächen, Tübingen, 1995.


Dissertation


D. Janzing. Limesdynamik translationsinvarianter Quantengittersysteme, Tübingen, 1998.


Habilitation thesis


D. Janzing. Computer science approach to quantum control, Karlsruhe 2006


Journal papers


D. Janzing and T. Beth. Fragility of a class of highly entangled states with n qubits. Phys. Rev. A, 61:052308-1-10, 2000.

D. Janzing, P. Wocjan, R. Zeier, R. Geiss, and Th. Beth. Thermodynamic cost of reliability and low temperatures: Tightening  Landauer's principle and the Second Law. Int. Jour. Theor. Phys., 39(12):2217-2753, 2000.

D. Janzing and Th. Beth. Complexity measure for continuous time quantum algorithms. Phys. Rev. A, 64(2):022301, 2001.

R. Steinwandt, D. Janzing, and Th. Beth. On using quantum protocols to detect traffic analysis. Quant. Inform. & Comp., 1(3):62--69, 2001.

D. Janzing and Th. Beth. Distinguishing n Hamiltonians on Cn by a single measurement. Phys. Rev. A, 65, 2002.

D. Janzing, F. Armknecht, R. Zeier, and Th. Beth. Quantum control without access to the controlling interaction. Phys. Rev. A, 65:022104, 2002.

P. Wocjan, D. Janzing, and Th. Beth. Simulating arbitrary pair-interactions by a given Hamiltonian: Graph-theoretical bounds on the time complexity. Quant. Inform. & Comp., 2(2):117--132, 2002.

D. Janzing, P. Wocjan, and Th. Beth. Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control. Phys. Rev. A 66, 042311-1-4, 2002. Selected for the Virtual Journal of Nanoscale Science & Technology, Nov 2002.

D. Janzing and Th. Beth. Quantum algorithm for measuring the eigenvalues of U\otimes U^{-1} for a black-box unitary transformation U. Quant. Inform. & Comp., 2(3):192--197, 2002.

D. Janzing. Quantum algorithm for measuring the energy of n qubits with unknown
  pair-interactions. Quant. Inform. & Comp., 2(3):198--207, 2002.

P. Wocjan, M. Rötteler, D. Janzing, and Th. Beth. Universal simulation of Hamiltonians using a finite set of control operations. Quant. Inform. & Comp., 2(2):133--150, 2002.

P. Wocjan, M. Rötteler, D. Janzing, and Th. Beth. Simulating Hamiltonians in quantum Networks: Efficient schemes and complexity bounds. Phys. Rev. A, 65:042309, 2002.

D. Janzing and T. Beth. Quasi-order of clocks and their synchronism and quantum bounds for copying timing information. IEEE Trans. Inform. Theor., 49(1):230--240, 2003.

D. Janzing, T. Decker, and Beth. T. Performing joint measurements and transformations on several qubits by operating on a single "control" qubit. Phys. Rev. A, (67):042320, 2003. selected for the Virtual Journal of Quantum information.

D. Janzing, P. Wocjan, and T. Beth. On the computational power of physical interactions: Bounds on the number of time steps for simulating arbitrary interaction graphs. Int. Jour. Found. Comp. Science, special issue for Quantum Computation, 14(5):889--903, 2002.

P. Wocjan, D. Janzing, and T. Beth. Two QCMA-complete problems. Quant. Inf. & Comp., 3(6):635--643, 2003.

P. Wocjan, D. Janzing, and Th. Beth. Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing. Quant. Inf. Proc., 2(4):259--270, 2003.

T. Decker, D. Janzing, and T. Beth. Quantum circuits for single-qubit measurements corresponding to platonic solids. Int. Journ. Quant. Inform., 2(3):353--377, 2004.

T. Decker, D. Janzing, and M. Rötteler. Implementation of group-covariant positive operator valued measures by orthogonal measurements. Journ. Math. Phys., 46:012104, 2005.

D. Janzing, P. Wocjan, and T. Beth. "Non-Identity check" is QMA-complete.
quant-ph/0305050, to appear in Int. Journ. Quant. Inf., 2005.

D. Janzing and P. Wocjan. Ergodic quantum computing. Quant. Inf. Proc., 4(2):129--158, 2005.


Papers in books and proceedings

D. Janzing and Th. Beth. Are there quantum bounds on the recyclability of clock signals in low power computers? In Proceedings of the DFG-Kolloquium VIVA, Chemnitz, 2002.

D. Janzing M. Rötteler P. Wocjan, T. Beth, M. Grassl and R. Zeier. Algorithms for Quantum Systems - Quantum Algorithms. In Quantum Information Processing, Ed. by G. Leuchs and T. Beth, Wiley-CH, Berlin, 2003.

D. Janzing. In Quanteninitiative Karlsruhe--Innsbruck, 1998.

D. Janzing. A quasi-order of resources as a new concept for a thermodynamic
theory of quantum state preparation. In Sciences of the interface, Genista Verlag, Tübingen, 2000.

P. Wocjan, D. Janzing, Th. Decker, and Th. Beth. Measuring 4-local n-qubit observables could probabilistically solve PSPACE. In Proceedings of the WISICT conference, Cancun 2004.

D. Janzing. Über den Zusammenhang zwischen thermodynamisch reversiblem,
kryptograpisch seitenkanalfreiem sowie quantenkohärentem Rechnen. To appear in Proceedings der 35. Jahrestagung der Gesellschaft für Informatik, Bonn, 2005.


Lectures notes


D. Janzing. Kann Statistik Ursachen beweisen? Universität Karlsruhe, SS 2003.
http://iaks-www.ira.uka.de/home/janzing/kausalskriptum03.ps

D. Janzing. Algorithmentechnik. Universität Karlsruhe, WS 2003/2004.
http://iaks-www.ira.uka.de/home/janzing/AlgotechSkriptDominik.pdf


Poster presentations


D. Janzing. Cooling simple quantum systems: information theory on the resource requirements. Capri, 2000.

D. Janzing. Complexity measure for continuous time quantum algorithms.  EU meeting, Potsdam 09/2000.

D. Janzing. Quasi-order of clock synchronism. IBM Watson Research, 01/2002.

D. Janzing. Complexity of molecular heat engines. Quantum Optics Meeting Obergurgl 2005.


Preprints


D. Janzing and Th. Beth. Remark on multi-particle states and observables with constant complexity. LANL-preprint quant-ph/0003117.

D. Janzing and T. Beth. Quantum noise influencing human behaviour could fake effectiveness of drugs in clinical trials. quant-ph/0208006.

P. Wocjan, D. Janzing, and T. Beth. Required sample size for learning sparse Bayesian networks with many variables. LANL-preprint cs.LG/0204052

W. Wocjan, D. Janzing, and Th. Beth. Lower bound on the chromatic number by spectra of weighted adjacency matrices. LANL-preprint cs.DM/0112023

D. Herrmann and D. Janzing. Selection criterion for log-linear models using statistical learning theory. LANL-preprint math.PR/03020, 2002.

D. Janzing and D. Herrmann. Reliable and efficient inference of Bayesian networks from sparse data by statistical learning theory. cs.LG/0309015

D. Janzing and T. Beth. Bounds on the entropy generated when timing information is extracted from microscopic systems. quant-ph/0301125

D. Janzing and T. Beth. Synchronizing quantum clocks with classical one-way communication: Bounds on the generated entropy. quant-ph/0306023

D. Janzing, P. Wocjan, and Th. Beth. Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete. quant-ph/0305050

D.Janzing. Decomposition of time-covariant operations on quantum systems with  continuous and/or discrete energy spectrum. quant-ph/0407144

D. Janzing. On the computational power of molecular heat engines. quant-ph/0502019

F. Schmüser and D. Janzing. On quantum A/D and D/A conversion. quant-ph/0505008

D. Janzing. Spin-1/2 particles moving on a 2d lattice with nearest-neighbor interactions can realize an autonomous quantum computer. quant-ph/0506270

D. Janzing. Quantum Computing Models as a Tool Box for Controlling and Understanding the Nanoscopic World. Manuscript.


Subjects of publication




Quantum Information: