Searcharxiv⌕ Search

arXiv subjects

Pawel Wocjan

Publications and source records attributed to Pawel Wocjan.

80 records · Page 5Linked to original sources
arXiv2002

Bounds on the number of time steps for simulating arbitrary interaction graphs

In previous papers we have considered mutual simulation of n-partite pair-interaction Hamiltonians. We have focussed on the running time overhead of general simulations, while considering the required number of time steps only for special cases (decoupling and time-reversal). These two complexity measures differ significantly. Here we derive lower bounds on the number of time steps for general simulations. In particular, the simulation of interaction graphs with irrational spectrum requires at least n steps. We discuss as examples graphs that correspond to graph codes and nearest neighbor interactions in 1- and 2-dimensional lattices. In the latter case the lower bounds are almost tight.

quant-ph↗
arXiv2002

Required sample size for learning sparse Bayesian networks with many variables

Learning joint probability distributions on n random variables requires exponential sample size in the generic case. Here we consider the case that a temporal (or causal) order of the variables is known and that the (unknown) graph of causal dependencies has bounded in-degree Delta. Then the joint measure is uniquely determined by the probabilities of all (2 Delta+1)-tuples. Upper bounds on the sample size required for estimating their probabilities can be given in terms of the VC-dimension of the set of corresponding cylinder sets. The sample size grows less than linearly with n.

cs.LG↗
arXiv2002

Complexity of decoupling and time-reversal for n spins with pair-interactions: Arrow of time in quantum control

Well-known Nuclear Magnetic Resonance experiments show that the time evolution according to (truncated) dipole-dipole interactions between n spins can be inverted by simple pulse sequences. Independent of n, the reversed evolution is only two times slower than the original one. Here we consider more general spin-spin couplings with long range. We prove that some are considerably more complex to invert since the number of required time steps and the slow-down of the reversed evolutions are necessarily of the order n. Furthermore, the spins have to be addressed separately. We show for which values of the coupling parameters the phase transition between simple and complex time-reversal schemes occurs.

quant-ph↗
arXiv2001

Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds

We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by applying sequences of appropriate local control sequences. Efficient schemes for decoupling and time reversal can be constructed from orthogonal arrays. Conditions on time optimal simulation are formulated in terms of spectral majorization of matrices characterizing the coupling parameters. Moreover, we consider a specific system of n harmonic oscillators with bilinear interaction. In this case, decoupling can efficiently be achieved using the combinatorial concept of difference schemes. For this type of interactions we present optimal schemes for inversion.

quant-ph↗
arXiv2001

Universal Simulation of Hamiltonians Using a Finite Set of Control Operations

Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is available. We show that there exist finite groups with this property and present a sufficient condition in terms of group characters. We give examples of such groups in dimension 2 and 3. Furthermore, we show that it is possible to simulate an arbitrary bipartite interaction by a given one using such groups acting locally on the subsystems.

quant-ph↗
arXiv2000

Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels

A conceptually simple method for derivation of lower bounds on the error exponent of specific families of block codes used on classical-quantum channels with arbitrary signal states over a finite Hilbert space is presented. It is shown that families of binary block codes with appropriately rescaled binomial multiplicity enumerators used on binary classical-quantum channels and decoded by the suboptimal decision rule introduced by Holevo attain the expurgated and cutoff rate lower bounds on the error exponent.

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↗