Related papers: Efficient Quantum Tensor Product Expanders and k-d…
One of the most natural connections between quantum and classical machine learning has been established in the context of kernel methods. Kernel methods rely on kernels, which are inner products of feature vectors living in large feature…
The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…
We provide a recursive method for constructing product formula approximations to exponentials of commutators, giving the first approximations that are accurate to arbitrarily high order. Using these formulas, we show how to approximate…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum…
Certain families of quantum mechanical models can be described and solved efficiently on a classical computer, including qubit or qudit Clifford circuits and stabilizer codes, free-boson or free-fermion models, and certain rotor and GKP…
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude…
Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…
We present new constructions of quantum codes of linear or close-to-linear distance and dimension with low-weight stabilizers. Only a few constructions of such codes were previously known, and were primarily based on a specific operation…
Unitary $k$-designs are probabilistic ensembles of unitary matrices whose first $k$ statistical moments match that of the full unitary group endowed with the Haar measure. In prior work, we showed that the automorphism group of classical…
Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods by executing quantum algorithms with tensor networks on conventional hardware. Unlike circuit models restricted to unitary gates, tensor…
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing $k$ copies of a function with less than $k$ times the quantum queries needed to compute one copy of the function implies that the…
Most research in quantum computing today is performed against simulations of quantum computers rather than true quantum computers. Simulating a quantum computer entails implementing all of the unitary operators corresponding to the quantum…
Random ensembles of pure states have proven to be extremely important in various aspects of quantum physics such as benchmarking the performance of quantum circuits, testing for quantum advantage, providing novel insights for many-body…
Local random circuits scramble efficiently and accordingly have a range of applications in quantum information and quantum dynamics. With a global $U(1)$ charge however, the scrambling ability is reduced; for example, such random circuits…
The efficient simulation of complex quantum systems remains a central challenge due to the exponential growth of Hilbert space with system size. Tensor network methods have long been established as powerful approximation schemes, and their…
We extend the quantum geometric tensor from the state space to the operator level,and investigate its properties like the additivity for factorizable models and the splitting of two kinds contributions for the case of stationary reference…
The factorized form of the unitary coupled cluster ansatz is a popular state preparation ansatz for electronic structure calculations of molecules on quantum computers. It often is viewed as an approximation (based on the Trotter product…
We study the problem of constructing strong approximate unitary $k$-designs on $D$-dimensional grids (and more generally on Cartesian products of graphs), building on the work of Schuster et al. arXiv:2509.26310 which establishes strong…
In the current NISQ era, there is demand for functional quantum devices to solve relevant computational problems, which motivates a utilitarian perspective on device design: The goal is to create a device that is able to run a given…