274 citations · 932 across the 21 of their papers we have counts for
19 papers · 1 filter
Fermionic Hamiltonians without trivial low-energy states
Yaroslav Herasymenko, Anurag Anshu, Barbara Terhal +1
We construct local fermionic Hamiltonians with no low-energy trivial states (NLTS), providing a fermionic counterpart to the NLTS theorem. Distinctly from the qubit case, we define…
Thrifty shadow estimation: re-using quantum circuits and bounding tails
Jonas Helsen, Michael Walter
Shadow estimation is a recent protocol that allows estimating exponentially many expectation values of a quantum state from ``classical shadows'', obtained by applying random quant…
Optimizing sparse fermionic Hamiltonians
Yaroslav Herasymenko, Maarten Stroeks, Jonas Helsen +1
We consider the problem of approximating the ground state energy of a fermionic Hamiltonian using a Gaussian state. In sharp contrast to the dense case, we prove that strictly -…
Spectral estimation for Hamiltonians: a comparison between classical imaginary-time evolution and quantum real-time evolution
Maarten Stroeks, Jonas Helsen, Barbara Terhal
We present a classical Monte Carlo (MC) scheme which efficiently estimates an imaginary-time, decaying signal for stoquastic (i.e. sign-problem-free) local Hamiltonians. The decay…
Estimating gate-set properties from random sequences
J. Helsen, M. Ioannou, J. Kitzinger +4
With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, c…
A benchmarking procedure for quantum networks
Jonas Helsen, Stephanie Wehner
We propose network benchmarking: a procedure to efficiently benchmark the quality of a quantum network link connecting quantum processors in a quantum network. This procedure is ba…
Matchgate benchmarking: Scalable benchmarking of a continuous family of many-qubit gates
Jonas Helsen, Sepehr Nezami, Matthew Reagor +1
We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates. This me…
A general framework for randomized benchmarking
Jonas Helsen, Ingo Roth, Emilio Onorati +2
Randomized benchmarking (RB) refers to a collection of protocols that in the past decade have become central methods for characterizing quantum gates. These protocols aim at effici…
Counting single-qubit Clifford equivalent graph states is #P-Complete
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Graph states, which include for example Bell states, GHZ states and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to err…
Transforming graph states to Bell-pairs is NP-Complete
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One f…
Spectral Quantum Tomography
Jonas Helsen, Francesco Battistel, Barbara M. Terhal
We introduce spectral quantum tomography, a simple method to extract the eigenvalues of a noisy few-qubit gate, represented by a trace-preserving superoperator, in a SPAM-resistant…
Benchmarking Gate Fidelities in a Si/SiGe Two-Qubit Device
X. Xue, T. F. Watson, J. Helsen +7
We report the first complete characterization of single-qubit and two-qubit gate fidelities in silicon-based spin qubits, including cross-talk and error correlations between the tw…
Efficient Unitarity Randomized Benchmarking of Few-qubit Clifford Gates
Bas Dirkse, Jonas Helsen, Stephanie Wehner
Unitarity randomized benchmarking (URB) is an experimental procedure for estimating the coherence of implemented quantum gates independently of state preparation and measurement er…
A new class of efficient randomized benchmarking protocols
Jonas Helsen, Xiao Xue, Lieven M. K. Vandersypen +1
Randomized benchmarking is a technique for estimating the average fidelity of a set of quantum gates. For general gatesets, however, it is difficult to draw robust conclusions from…
How to transform graph states using single-qubit operations: computational complexity and algorithms
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Graph states are ubiquitous in quantum information with diverse applications ranging from quantum network protocols to measurement based quantum computing. Here we consider the que…
Quantum error correction in crossbar architectures
Jonas Helsen, Mark Steudtner, Menno Veldhorst +1
A central challenge for the scaling of quantum computing systems is the need to control all qubits in the system without a large overhead. A solution for this problem in classical…
Multi-qubit Randomized Benchmarking Using Few Samples
Jonas Helsen, Joel J. Wallman, Steven T. Flammia +1
Randomized benchmarking (RB) is an efficient and robust method to characterize gate errors in quantum circuits. Averaging over random sequences of gates leads to estimates of gate…
Representations of the multi-qubit Clifford group
Jonas Helsen, Joel J. Wallman, Stephanie Wehner
The Clifford group is a fundamental structure in quantum information with a wide variety of applications. We discuss the tensor representations of the -qubit Clifford group, whi…
Device-independence for two-party cryptography and position verification
Jeremy Ribeiro, Le Phuc Thinh, Jedrzej Kaniewski +2
Quantum communication has demonstrated its usefulness for quantum cryptography far beyond quantum key distribution. One domain is two-party cryptography, whose goal is to allow two…