Related papers: Gluing Random Unitaries with Inverses and Applicat…
This is the second of a pair of articles on scattering of glue by glue, in which we give the light-cone gauge calculation of the one-loop on-shell helicity conserving scattering amplitudes for gluon-gluon scattering (neglecting quark…
Quantifying quantum states' complexity is a key problem in various subfields of science, from quantum computing to black-hole physics. We prove a prominent conjecture by Brown and Susskind about how random quantum circuits' complexity…
We present an argument reinterpreting the generalized uncertainty principle (GUP) and its associated minimal length as an effective variation of Planck constant ($\hbar$), complementing Dirac's large number hypothesis of varying $G$. We…
In this article we consider n gluon color ordered, planar amplitudes in N=4 super Yang Mills at strong 't Hooft coupling. These amplitudes are approximated by classical surfaces in AdS_5 space. We compute the value of the amplitude for a…
We consider a new class of non-Hermitian random matrices, namely the ones which have the form of sums of freely independent terms involving unitary matrices. To deal with them, we exploit the recently developed quaternion technique. After…
We prove several results giving new and stronger connections between learning, circuit lower bounds and pseudorandomness. Among other results, we show a generic learning speedup lemma, equivalences between various learning models in the…
Recent results by Alagic and Russell have given some evidence that the Even-Mansour cipher may be secure against quantum adversaries with quantum queries, if considered over other groups than $(\mathbb{Z}/2)^n$. This prompts the question as…
In this work we consider a novel heuristic decomposition algorithm for $n$-qubit gates that implement specified amplitude permutations on sparse states with $m$ non-zero amplitudes. These gates can be useful as an algorithmic primitive for…
We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
A device-independent randomness expansion protocol aims to take an initial random string and generate a longer one, where the security of the protocol does not rely on knowing the inner workings of the devices used to run it. In order to do…
Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…
We consider error-correction coding schemes for adversarial wiretap channels (AWTCs) in which the channel can a) read a fraction of the codeword bits up to a bound $r$ and b) flip a fraction of the bits up to a bound $p$. The channel can…
We study strong indispensability of minimal free resolutions of semigroup rings. We focus on two operations, gluing and extending, used in literature to produce more examples with a special property from the existing ones. We give a naive…
Let integer $n \ge 3$ and integer $r = r(n) \ge 3$. Define the binomial random $r$-uniform hypergraph $H_r(n, p)$ to be the $r$-uniform graph on the vertex set $[n]$ such that each $r$-set is an edge independently with probability $p$. A…
The optimizations of the track fittings require complex simulations of silicon strip detectors to be compliant with the fundamental properties of the hit heteroscedasticity. Many different generations of random numbers must be available…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
We show how to construct an arbitrary robust one-qubit unitary operation with a control Hamiltonian of $A_x(t) \sigma_x + A_y(t) \sigma_y$, where $\sigma_i$ is a Pauli matrix and $A_i(t)$ is piecewise constant. Our method, based on planar…
Coherent errors in quantum operations are ubiquitous. Whether arising from spurious environmental couplings or errors in control fields, such errors can accumulate rapidly and degrade the performance of a quantum circuit significantly more…
Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the…