Searcharxiv⌕ Search

arXiv subjects

Dominik Janzing

Publications and source records attributed to Dominik Janzing.

At least 127 records · Page 7Linked to original sources
arXiv2003

Identity check is QMA-complete

We define the problem identity check: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete. A generalization of this problem is equivalence check: Given two descriptions of quantum circuits and a description of a common invariant subspace, decide whether the restrictions of the circuits to this subspace almost coincide. We show that equivalence check is also in QMA and hence QMA-complete.

quant-ph↗
arXiv2003

Cooling and Low Energy State Preparation for 3-local Hamiltonians are FQMA-complete

We introduce the quantum complexity class FQMA. This class describes the complexity of generating a quantum state that serves as a witness for a given QMA problem. In a certain sense, FQMA is the quantum analogue of FNP (function problems associated with NP). The latter describes the complexity of finding a succinct proof for a NP decision problem. Whereas all FNP problems can be reduced to NP, there is no obvious reduction of FQMA to QMA since the solution of FQMA is a quantum state and the solution of QMA the answer yes or no. We consider quantum state generators that get classical descriptions of 3-local Hamiltonians on n qubits as input and prepare low energy states for these systems as output. We show that such state generators can be used to prepare witnesses for QMA problems. Hence low energy state preparation is FQMA-complete. Our proofs are extensions of the proofs by Kitaev et al. and Kempe and Regev for the QMA-completeness of k-local Hamiltonian problems. We show that FQMA can be solved by preparing thermal equilibrium states with an appropriate temperature decreasing as the reciprocal of a polynomial in n.

quant-ph↗
arXiv2003

Selection Criterion for Log-Linear Models Using Statistical Learning Theory

Log-linear models are a well-established method for describing statistical dependencies among a set of n random variables. The observed frequencies of the n-tuples are explained by a joint probability such that its logarithm is a sum of functions, where each function depends on as few variables as possible. We obtain for this class a new model selection criterion using nonasymptotic concepts of statistical learning theory. We calculate the VC dimension for the class of k-factor log-linear models. In this way we are not only able to select the model with the appropriate complexity, but obtain also statements on the reliability of the estimated probability distribution. Furthermore we show that the selection of the best model among a set of models with the same complexity can be written as a convex optimization problem.

math.ST↗
arXiv2003

Treating the Independent Set Problem by 2D Ising Interactions with Adiabatic Quantum Computing

We construct a nearest-neighbor Hamiltonian whose ground states encode the solutions to the NP-complete problem INDEPENDENT SET in cubic planar graphs. The Hamiltonian can be easily simulated by Ising interactions between adjacent particles on a 2D rectangular lattice. We describe the required pulse sequences. Our methods could help to implement adiabatic quantum computing by physically reasonable Hamiltonians like short-range interactions.

quant-ph↗
arXiv2003

Bounds on the entropy generated when timing information is extracted from microscopic systems

We consider Hamiltonian quantum systems with energy bandwidth ΔE and show that each measurement that determines the time up to an error Δt generates at least the entropy (\hbar/(Δt ΔE))^2/2. Our result describes quantitatively to what extent all timing information is quantum information in systems with limited energy. It provides a lower bound on the dissipated energy when timing information of microscopic systems is converted to classical information. This is relevant for low power computation since it shows the amount of heat generated whenever a band limited signal controls a classical bit switch. Our result provides a general bound on the information-disturbance trade-off for von-Neumann measurements that distinguish states on the orbits of continuous unitary one-parameter groups with bounded spectrum. In contrast, information gain without disturbance is possible for some completely positive semi-groups. This shows that readout of timing information can be possible without entropy generation if the autonomous dynamical evolution of the clock is dissipative itself.

quant-ph↗
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

Quantum noise influencing human behaviour could fake effectiveness of drugs in clinical trials

To test the effectiveness of a drug one can advice two randomly selected groups of patients to take or not to take it, respectively. It is well-known that the causal effect cannot be identified if not all patients comply. This holds even when the non-compliers can be identified afterwards since latent factors like patient's personality can influence both his decision and his physical response. However, one can still give bounds on the effectiveness of the drug depending on the rate of compliance. Remarkably, the proofs of these bounds given in the literature rely on models that represent all relevant latent factors (including noise) by hidden classical variables. In strong analogy to the violation of Bell's inequality, some of these bounds fail if patient's behavior is influenced by latent quantum processes (e.g. in his nervous system). Quantum effects could fake an increase of the recovery rate by about 13% although the drug would hurt as many patients as it would help if everyone took it. The other bounds are true even in the quantum case. We do not present any realistic model showing this effect, we only point out that the physics of decision making could be relevant for the causal interpretation of every-day life statistical data.

quant-ph↗
arXiv2002

Performing joint measurements and transformations on several qubits by operating on a single control qubit

An n-qubit quantum register can in principle be completely controlled by operating on a single qubit that interacts with the register via an appropriate fixed interaction. We consider a hypothetical system consisting of n spin-1/2 nuclei that interact with an electron spin via a magnetic interaction. We describe algorithms that measure non-trivial joint observables on the register by acting on the control spin only. For large n this is not an efficient model for universal quantum computation but it can be modified to an efficient one if one allows n possible positions of the control particle. This toy model of measurements illustrates in which way specific interactions between the register and a probe particle support specific types of joint measurements in the sense that some joint observables can be measured by simple sequences of operations on the probe particle.

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↗
arXiv2002

Are there quantum bounds on the recyclability of clock signals in low power computers?

Even if a logical network consists of thermodynamically reversible gate operations, the computation process may have high dissipation rate if the gate implementation is controlled by external clock signals. It is an open question whether the global clocking mechanism necessarily envolves irreversible processes. However, one can show that it is not possible to extract any timing information from a micro-physical clock without disturbing it. Applying recent results of quantum information theory we can show a hardware-independent lower bound on the timing information that is necessarily destroyed if one tries to copy the signal. The bound becomes tighter for low energy signals, i.e., the timing information gets more and more quantum.

quant-ph↗
arXiv2001

Quasi-order of clocks and synchronism and quantum bounds for copying timing information

The statistical state of any (classical or quantum) system with non-trivial time evolution can be interpreted as the pointer of a clock. The quality of such a clock is given by the statistical distinguishability of its states at different times. If a clock is used as a resource for producing another one the latter can at most have the quality of the resource. We show that this principle, formalized by a quasi-order, implies constraints on many physical processes. Similarly, the degree to which two (quantum or classical) clocks are synchronized can be formalized by a quasi-order of synchronism. Copying timing information is restricted by quantum no-cloning and no-broadcasting theorems since classical clocks can only exist in the limit of infinite energy. We show this quantitatively by comparing the Fisher timing information of two output systems to the input's timing information. For classical signal processing in the quantum regime our results imply that a signal looses its localization in time if it is amplified and distributed to many devices.

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↗
arXiv2001

Quantum algorithm for measuring the energy of n qubits with unknown pair-interactions

The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown n-qubit pair-interaction Hamiltonian into a conditional one such that standard phase estimation can be applied to measure the energy. Our essential assumption is that the considered system can be brought into interaction with a quantum computer. For large n the algorithm could still be applicable for estimating the density of energy states and might therefore be useful for finding energy gaps in solid states.

quant-ph↗
arXiv2001

Quantum algorithm for finding periodicities in the spectrum of a black-box Hamiltonian or unitary transformation

Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure eigenvalues of U\otimes U^\dagger even in this case. Running the algorithm several times allows therefore to estimate the autocorrelation function of the density of eigenstates of U. This can be applied to find periodicities in the energy spectrum of a quantum system with unknown Hamiltonian if it can be coupled to a quantum computer.

quant-ph↗
arXiv2001

On Using Quantum Protocols to Detect Traffic Analysis

We consider the problem of detecting whether an attacker measures the amount of traffic sent over a communication channel-possibly without extracting information about the transmitted data. A basic approach for designing a quantum protocol for detecting a perpetual traffic analysis of this kind is described.

quant-ph↗