arXiv subjects

Norbert Schuch

Publications and source records attributed to Norbert Schuch.

114 records · Page 7Linked to original sources

arXiv2008

Strings, Projected Entangled Pair States, and variational Monte Carlo methods

We introduce string-bond states, a class of states obtained by placing strings of operators on a lattice, which encompasses the relevant states in Quantum Information. For string-bond states, expectation values of local observables can be computed efficiently using Monte Carlo sampling, making them suitable for a variational abgorithm which extends DMRG to higher dimensional and irregular systems. Numerical results demonstrate the applicability of these states to the simulation of many-body sytems.

quant-ph↗

arXiv2008

Entropy scaling and simulability by Matrix Product States

We investigate the relation between the scaling of block entropies and the efficient simulability by Matrix Product States (MPS), and clarify the connection both for von Neumann and Renyi entropies (see Table I). Most notably, even states obeying a strict area law for the von Neumann entropy are not necessarily approximable by MPS. We apply these results to illustrate that quantum computers might outperform classical computers in simulating the time evolution of quantum systems, even for completely translational invariant systems subject to a time independent Hamiltonian.

quant-ph↗

arXiv2007

The computational complexity of PEPS

We determine the computational power of preparing Projected Entangled Pair States (PEPS), as well as the complexity of classically simulating them, and generally the complexity of contracting tensor networks. While creating PEPS allows to solve PP problems, the latter two tasks are both proven to be #P-complete. We further show how PEPS can be used to approximate ground states of gapped Hamiltonians, and that creating them is easier than creating arbitrary PEPS. The main tool for our proofs is a duality between PEPS and postselection which allows to use existing results from quantum compexity.

quant-ph↗

arXiv2004

Quantum entanglement theory in the presence of superselection rules

Superselection rules severly constrain the operations which can be implemented on a distributed quantum system. While the restriction to local operations and classical communication gives rise to entanglement as a nonlocal resource, particle number conservation additionally confines the possible operations and should give rise to a new resource. In [Phys. Rev. Lett. 92, 087904 (2004), quant-ph/0310124] we showed that this resource can be quantified by a single additional number, the superselection induced variance (SiV) without changing the concept of entanglement. In this paper, we give the results on pure states in greater detail; additionally, we provide a discussion of mixed state nonlocality with superselection rules where we consider both formation and distillation. Finally, we demonstrate that SiV is indeed a resource, i.e., that it captures how well a state can be used to overcome the restrictions imposed by the superselection rule.

quant-ph↗

arXiv2003

Programmable networks for quantum algorithms

The implementation of a quantum computer requires the realization of a large number of N-qubit unitary operations which represent the possible oracles or which are part of the quantum algorithm. Until now there are no standard ways to uniformly generate whole classes of N-qubit gates. We have developed a method to generate arbitrary controlled phase shift operations with a single network of one-qubit and two-qubit operations. This kind of network can be adapted to various physical implementations of quantum computing and is suitable to realize the Deutsch-Jozsa algorithm as well as Grover's search algorithm.

quant-ph↗

arXiv2003

Natural two-qubit gate for quantum computation using the XY interaction

The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the CNOT gate can be realized easily. It can be shown that, e.g., with the XY interaction more than one two-qubit operation is required in order to realize CNOT. Here we propose a two-qubit gate for the XY interaction which combines CNOT with the SWAP operation. By using this gate quantum circuits can be implemented efficiently, even if only nearest-neighbor coupling between the qubits is available.

quant-ph↗