We review the mathematical speed limits on quantum information processing in many-body
systems. After the proof of the Lieb–Robinson Theorem in 1972, the past two decades have …

The swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can
be considered a classical operation because it does not entangle product states. Genuinely …

A core challenge for superconducting quantum computers is to scale up the number of
qubits in each processor without increasing noise or cross-talk. Distributed quantum …

We study the problem of implementing arbitrary permutations of qubits under interaction
constraints in quantum systems that allow for arbitrarily fast local operations and classical …

We introduce a volumetric benchmark for near-term quantum platforms based on the
generation and verification of genuine entanglement across n-qubits using graph states and …

Abstract The Vertex Separator Problem of a directed graph consists in finding all
combinations of vertices which can disconnect the source and the terminal of the graph …

We theoretically explore the generation of entangled two-photon pairs through Cooper pair
recombination within a noncentrosymmetric [001]-quantum well superconductor …

Quantum computers have come a long way since conception, and there is still a long way to
go before the dream of universal, fault-tolerant computation is realized. In the near term …

Noise-aware Comparison of Chiplet vs. Monolithic Quantum Computing Page 1 Noise-aware
Comparison of Chiplet vs. Monolithic Quantum Computing Kaitlin N. Smith1,†,∗, Nicholas …

The connectivity between qubits is one of the many design aspects that go into building a
quantum computer. Better connectivity makes it easier to perform arbitrary interacting …