34 citations · 170 across the 23 of their papers we have counts for
25 papers
Testing bosonic and fermionic Gaussian states with a constant number of copies
Jop Briët, Davi Castro-Silva, Michael Walter +1
Bosonic and fermionic Gaussian quantum states are families of quantum states that play a central role in quantum physics and quantum information processing. We study the problem of…
Optimal Ground-State Preparation with a Guiding State
Stacey Jeffery, Rolando D. Somma, Freek Witteveen +1
Suppose a Hamiltonian has a unique ground state with an eigenvalue , and we have an estimate such that , and there is a…
Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State
Rolando D. Somma, Ronald de Wolf
Suppose we can apply the unitary for some Hamiltonian , and are given access to a unitary that prepares a guiding state promised to have overlap at least with…
Optimal tomography of bosonic and fermionic Gaussian states
Senrui Chen, Marco Fanizza, Filippo Girardi +4
The sample complexity is the minimum number of copies required to learn an accurate classical description of a quantum state. Bosonic and fermionic Gaussian quantum states are fami…
Approximate QCAs in one dimension using approximate algebras
Daniel Ranard, Michael Walter, Freek Witteveen
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, wh…
A random purification channel for arbitrary symmetries with applications to fermions and bosons
Michael Walter, Freek Witteveen
The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries:…
Adiabatic preparation of many-body quantum states: getting the beginning and ending right
Emil T. M. Pedersen, Freek Witteveen, Klaus Mølmer +1
We present numerical calculations, and simulations performed on a Rydberg atom quantum simulator, of the adiabatic evolution of many-body quantum systems around a quantum phase tra…
Limits to black-box amplification in QMA
Scott Aaronson, Phillip Harris, Freek Witteveen
We study the limitations of black-box amplification in the quantum complexity class QMA. Amplification is known to boost any inverse-polynomial gap between completeness and soundne…
Is it Gaussian? Testing bosonic quantum states
Filippo Girardi, Freek Witteveen, Francesco Anna Mele +4
Gaussian states are widely regarded as one of the most relevant classes of continuous-variable (CV) quantum states, as they naturally arise in physical systems and play a key role…
Randomized truncation of quantum states
Aram W. Harrow, Angus Lowe, Freek Witteveen
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal d…
Computational complexity of injective projected entangled pair states
Dylan Harley, Freek Witteveen, Daniel Malz
Projected entangled pair states (PEPS) constitute a variational family of quantum states with area-law entanglement. PEPS are particularly relevant and successful for studying grou…
How to use quantum computers for biomolecular free energies
Jakob Günther, Thomas Weymuth, Moritz Bensberg +18
Free energy calculations are at the heart of physics-based analyses of biochemical processes. They allow us to quantify molecular recognition mechanisms, which determine a wide ran…
with an infinite counter
Stacey Jeffery, Freek Witteveen
A long-standing open problem in quantum complexity theory is whether , the quantum analogue of , is equal to , its one-sided error variant. We sho…
phase2: Full-State Vector Simulation of Quantum Time Evolution at Scale
Marek Miller, Jakob Günther, Freek Witteveen +5
Classical simulation of quantum computers is essential for designing and benchmarking quantum algorithms. Here we present phase2, a full-state-vector simulator optimised for sequen…
Phase estimation with partially randomized time evolution
Jakob Günther, Freek Witteveen, Alexander Schmidhuber +3
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computat…
High ground state overlap via quantum embedding methods
Mihael Erakovic, Freek Witteveen, Dylan Harley +7
Quantum computers can accurately compute ground state energies using phase estimation, but this requires a guiding state that has significant overlap with the true ground state. Fo…
The resource theory of tensor networks
Matthias Christandl, Vladimir Lysikov, Vincent Steffan +2
Tensor networks provide succinct representations of quantum many-body states and are an important computational tool for strongly correlated quantum systems. Their expressive and c…
Fun with replicas: tripartitions in tensor networks and gravity
Geoff Penington, Michael Walter, Freek Witteveen
We introduce a new correlation measure for tripartite pure states that we call . The quantity is symmetric with respect to the subsystems , , , invariant under l…
The minimal canonical form of a tensor network
Arturo Acuaviva, Visu Makam, Harold Nieuwboer +4
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 prod…
Random tensor networks with nontrivial links
Newton Cheng, Cécilia Lancien, Geoff Penington +2
Random tensor networks are a powerful toy model for understanding the entanglement structure of holographic quantum gravity. However, unlike holographic quantum gravity, their enta…
A converse to Lieb-Robinson bounds in one dimension using index theory
Daniel Ranard, Michael Walter, Freek Witteveen
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…
Bosonic entanglement renormalization circuits from wavelet theory
Freek Witteveen, Michael Walter
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…
Hypergraph min-cuts from quantum entropies
Michael Walter, Freek Witteveen
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 b…
Signal processing techniques for efficient compilation of controlled rotations in trapped ions
Koen Groenland, Freek Witteveen, Kareljan Schoutens +1
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 nativ…