SearcharxivSearch

arXiv subjects

Johan Åberg

Publications and source records attributed to Johan Åberg.

12 recordsLinked to original sources

Runtime-coherence trade-offs for hybrid SAT-solvers

Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts.This raises the question of how to divide computational tasks into a collection of parallelizable sub-problems, each of which can be solved by a quantum computer with limited coherence time. Here, we approach this question via hybrid algorithms for the k-SAT problem. Our analysis is based on Schöning's algorithm, which solves instances of k-SAT by performing random walks in the space of potential assignments. The search space of the walk allows for "natural" partitions, where we subject only one part of the partition to a Grover search, while the rest is sampled classically, thus resulting in a hybrid scheme. In this setting, we argue that there exists a simple trade-off relation between the total runtime and the coherence-time, which no such partition based hybrid-scheme can surpass. For several concrete choices of partitions, we explicitly determine the specific runtime coherence-time relations, and show saturation of the ideal trade-off. Finally, we present numerical simulations which suggest additional flexibility in implementing hybrid algorithms with optimal trade-off.

quant-ph

Classical restrictions of generic matrix product states are quasi-locally Gibbsian

We show that the norm squared amplitudes with respect to a local orthonormal basis (the classical restriction) of finite quantum systems on one-dimensional lattices can be exponentially well approximated by Gibbs states of local Hamiltonians (i.e., are quasi-locally Gibbsian) if the classical conditional mutual information (CMI) of any connected tripartition of the lattice is rapidly decaying in the width of the middle region. For injective matrix product states, we moreover show that the classical CMI decays exponentially, whenever the collection of matrix product operators satisfies a 'purity condition'; a notion previously established in the theory of random matrix products. We furthermore show that violations of the purity condition enables a generalized notion of error correction on the virtual space, thus indicating the non-generic nature of such violations. We make this intuition more concrete by constructing a probabilistic model where purity is a typical property. The proof of our main result makes extensive use of the theory of random matrix products, and may find applications elsewhere.

quant-ph

Semidefinite tests for quantum network topologies

Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. Generally, these protocols involve many independent sources sharing entanglement among distant parties that, upon measuring their systems, generate correlations across the network. The question of which correlations a given quantum network can give rise to, remains almost uncharted. Here we show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks. The network topology yields tests that can be cast as semidefinite programs, thus allowing for the efficient characterization of the correlations in a wide class of quantum networks, as well as systematic derivations of device-independent and experimentally testable witnesses. We obtain such semidefinite tests for fixed measurement settings, as well as parties that independently choose among collections of measurement settings. The applicability of the method is demonstrated for various networks, and compared with previous approaches.

quant-ph

Holonomy for Quantum Channels

A quantum holonomy reflects the curvature of some underlying structure of quantum mechanical systems, such as that associated with quantum states. Here, we extend the notion of holonomy to families of quantum channels, i.e., trace preserving completely positive maps. By the use of the Jamiołkowski isomorphism, we show that the proposed channel holonomy is related to the Uhlmann holonomy. The general theory is illustrated for specific examples. We put forward a physical realization of the channel holonomy in terms of interferometry. This enables us to identify a gauge invariant physical object that directly relates to the channel holonomy. Parallel transport condition and concomitant gauge structure are delineated in the case of smoothly parametrized families of channels. Finally, we point out that interferometer tests that have been carried out in the past to confirm the $4π$ rotation symmetry of the neutron spin, can be viewed as early experimental realizations of the channel holonomy.

quant-ph

Non-Abelian generalization of off-diagonal geometric phases

If a quantum system evolves in a noncyclic fashion the corresponding geometric phase or holonomy may not be fully defined. Off-diagonal geometric phases have been developed to deal with such cases. Here, we generalize these phases to the non-Abelian case, by introducing off-diagonal holonomies that involve evolution of more than one subspace of the underlying Hilbert space. Physical realizations of the off-diagonal holonomies in adiabatic evolution and interferometry are put forward.

quant-ph

Manifestations of quantum holonomy in interferometry

Abelian and non-Abelian geometric phases, known as quantum holonomies, have attracted considerable attention in the past. Here, we show that it is possible to associate nonequivalent holonomies to discrete sequences of subspaces in a Hilbert space. We consider two such holonomies that arise naturally in interferometer settings. For sequences approximating smooth paths in the base (Grassmann) manifold, these holonomies both approach the standard holonomy. In the one-dimensional case the two types of holonomies are Abelian and coincide with Pancharatnam's geometric phase factor. The theory is illustrated with a model example of projective measurements involving angular momentum coherent states.

quant-ph

Noncyclic geometric changes of quantum states

Non-Abelian quantum holonomies, i.e., unitary state changes solely induced by geometric properties of a quantum system, have been much under focus in the physics community as generalizations of the Abelian Berry phase. Apart from being a general phenomenon displayed in various subfields of quantum physics, the use of holonomies has lately been suggested as a robust technique to obtain quantum gates; the building blocks of quantum computers. Non-Abelian holonomies are usually associated with cyclic changes of quantum systems, but here we consider a generalization to noncyclic evolutions. We argue that this open-path holonomy can be used to construct quantum gates. We also show that a structure of partially defined holonomies emerges from the open-path holonomy. This structure has no counterpart in the Abelian setting. We illustrate the general ideas using an example that may be accessible to tests in various physical systems.

quant-ph

Weak cloning of an unknown quantum state

The impossibility to clone an unknown quantum state is a powerful principle to understand the nature of quantum mechanics, especially within the context of quantum computing and quantum information. This principle has been generalized to quantitative statements as to what extent imperfect cloning is possible. We delineate an aspect of the border between the possible and the impossible concerning quantum cloning, by putting forward an entanglement-assisted scheme for simulating perfect cloning in the context of weak measurements. This phenomenon we call weak cloning of an unknown quantum state.

quant-ph

The quantum adiabatic search with decoherence in the instantaneous energy eigenbasis

In Phys. Rev. A {\bf 71}, 060312(R) (2005) the robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian was examined. We expand this analysis to include the case of the global adiabatic quantum search. As in the case of the local search the asymptotic time complexity for the global search is the same as for the ideal closed case, as long as the Hamiltonian dynamics is present. In the case of pure decoherence, where the environment monitors the search Hamiltonian, we find that the time complexity of the global quantum adiabatic search scales like $N^{3/2}$, where $N$ is the list length. We moreover extend the analysis to include success probabilities $p<1$ and prove bounds on the run time with the same scaling as in the conditions for the $p\to 1$ limit. We supplement the analytical results by numerical simulations of the global and local search.

quant-ph

Adiabatic Approximation for weakly open systems

We generalize the adiabatic approximation to the case of open quantum systems, in the joint limit of slow change and weak open system disturbances. We show that the approximation is ``physically reasonable'' as under wide conditions it leads to a completely positive evolution, if the original master equation can be written on a time-dependent Lindblad form. We demonstrate the approximation for a non-Abelian holonomic implementation of the Hadamard gate, disturbed by a decoherence process. We compare the resulting approximate evolution with numerical simulations of the exact equation.

quant-ph

Robustness of the adiabatic quantum search

The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as the Hamiltonian dynamics is present. In the special case of pure decoherence where the environment monitors the search Hamiltonian, it is shown that the local adiabatic quantum search performs as the classical search.

quant-ph

Subspace preserving completely positive maps

A class of quantum channels and completely positive maps (CPMs) are introduced and investigated. These, which we call subspace preserving (SP) CPMs has, in the case of trace preserving CPMs, a simple interpretation as those which preserve probability weights on a given orthogonal sum decomposition of the Hilbert space of a quantum system. Several equivalent characterizations of SP CPMs are proved and an explicit construction of all SP CPMs, is provided. For a subclass of the SP channels a construction in terms of joint unitary evolution with an ancilla system, is presented.

quant-ph