Searcharxiv⌕ Search

arXiv subjects

Freek Witteveen

Publications and source records attributed to Freek Witteveen.

25 records · Page 2Linked to original sources

Fun with replicas: tripartitions in tensor networks and gravity

We introduce a new correlation measure for tripartite pure states that we call $G(A:B:C)$. The quantity is symmetric with respect to the subsystems $A$, $B$, $C$, invariant under local unitaries, and is bounded from above by $\log d_A d_B$. For random tensor network states, we prove that $G(A:B:C)$ is equal to the size of the minimal tripartition of the tensor network, i.e., the logarithmic bond dimension of the smallest cut that partitions the network into three components with $A$, $B$, and $C$. We argue that for holographic states with a fixed spatial geometry, $G(A:B:C)$ is similarly computed by the minimal area tripartition. For general holographic states, $G(A:B:C)$ is determined by the minimal area tripartition in a backreacted geometry, but a smoothed version is equal to the minimal tripartition in an unbackreacted geometry at leading order. We briefly discuss a natural family of quantities $G_n(A:B:C)$ for integer $n \geq 2$ that generalize $G=G_2$. In holography, the computation of $G_n(A:B:C)$ for $n>2$ spontaneously breaks part of a $\mathbb{Z}_n \times \mathbb{Z}_n$ replica symmetry. This prevents any naive application of the Lewkowycz-Maldacena trick in a hypothetical analytic continuation to $n=1$.

hep-th↗

The minimal canonical form of a tensor network

Tensor networks have a gauge degree of freedom on the virtual degrees of freedom that are contracted. A canonical form is a choice of fixing this degree of freedom. For matrix product states, choosing a canonical form is a powerful tool, both for theoretical and numerical purposes. On the other hand, for tensor networks in dimension two or greater there is only limited understanding of the gauge symmetry. Here we introduce a new canonical form, the minimal canonical form, which applies to projected entangled pair states (PEPS) in any dimension, and prove a corresponding fundamental theorem. Already for matrix product states this gives a new canonical form, while in higher dimensions it is the first rigorous definition of a canonical form valid for any choice of tensor. We show that two tensors have the same minimal canonical forms if and only if they are gauge equivalent up to taking limits; moreover, this is the case if and only if they give the same quantum state for any geometry. In particular, this implies that the latter problem is decidable - in contrast to the well-known undecidability for PEPS on grids. We also provide rigorous algorithms for computing minimal canonical forms. To achieve this we draw on geometric invariant theory and recent progress in theoretical computer science in non-commutative group optimization.

quant-ph↗

A converse to Lieb-Robinson bounds in one dimension using index theory

Unitary dynamics with a strict causal cone (or "light cone") have been studied extensively, under the name of quantum cellular automata (QCAs). In particular, QCAs in one dimension have been completely classified by an index theory. Physical systems often exhibit only approximate causal cones; Hamiltonian evolutions on the lattice satisfy Lieb-Robinson bounds rather than strict locality. This motivates us to study approximately locality preserving unitaries (ALPUs). We show that the index theory is robust and completely extends to one-dimensional ALPUs. As a consequence, we achieve a converse to the Lieb-Robinson bounds: any ALPU of index zero can be exactly generated by some time-dependent, quasi-local Hamiltonian in constant time. For the special case of finite chains with open boundaries, any unitary satisfying the Lieb-Robinson bound may be generated by such a Hamiltonian. We also discuss some results on the stability of operator algebras which may be of independent interest.

quant-ph↗

Quantum circuit approximations and entanglement renormalization for the Dirac field in 1+1 dimensions

The multiscale entanglement renormalization ansatz describes quantum many-body states by a hierarchical entanglement structure organized by length scale. Numerically, it has been demonstrated to capture critical lattice models and the data of the corresponding conformal field theories with high accuracy. However, a rigorous understanding of its success and precise relation to the continuum is still lacking. To address this challenge, we provide an explicit construction of entanglement-renormalization quantum circuits that rigorously approximate correlation functions of the massless Dirac conformal field theory. We directly target the continuum theory: discreteness is introduced by our choice of how to probe the system, not by any underlying short-distance lattice regulator. To achieve this, we use multiresolution analysis from wavelet theory to obtain an approximation scheme and to implement entanglement renormalization in a natural way. This could be a starting point for constructing quantum circuit approximations for more general conformal field theories.

quant-ph↗

Hypergraph min-cuts from quantum entropies

The min-cut function of weighted hypergraphs and the von Neumann entropy of pure quantum states are both symmetric submodular functions. In this note, we explain this coincidence by proving that the min-cut function of any weighted hypergraph can be approximated (up to an overall rescaling) by the entropies of quantum states known as stabilizer states. This implies that the min-cuts of hypergraphs are constrained by quantum entropy inequalities, and it shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones, as has been conjectured in the recent literature.

quant-ph↗

Bosonic entanglement renormalization circuits from wavelet theory

Entanglement renormalization is a unitary real-space renormalization scheme. The corresponding quantum circuits or tensor networks are known as MERA, and they are particularly well-suited to describing quantum systems at criticality. In this work we show how to construct Gaussian bosonic quantum circuits that implement entanglement renormalization for ground states of arbitrary free bosonic chains. The construction is based on wavelet theory, and the dispersion relation of the Hamiltonian is translated into a filter design problem. We give a general algorithm that approximately solves this design problem and provide an approximation theory that relates the properties of the filters to the accuracy of the corresponding quantum circuits. Finally, we explain how the continuum limit (a free bosonic quantum field) emerges naturally from the wavelet construction.

quant-ph↗

Signal processing techniques for efficient compilation of controlled rotations in trapped ions

Quantum logic gates with many control qubits are essential in many quantum algorithms, but remain challenging to perform in current experiments. Trapped ion quantum computers natively feature a different type of entangling operation, namely the Molmer-Sorensen (MS) gate which effectively applies an Ising interaction to all qubits at the same time. We consider a sequence of equal all-to-all MS operations, interleaved with single qubit gates that act only on one special qubit. Using a connection with quantum signal processing techniques, we find that it is possible to perform an arbitray SU(2) rotation on the special qubit if and only if all other qubits are in the state |1>. Such controlled rotation gates with N-1 control qubits require 2N applications of the MS gate, and can be mapped to a conventional Toffoli gate by demoting a single qubit to ancilla.

quant-ph↗