Related papers: Tight Correlation Bounds for Circuits Between AC0 …
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum…
We study the properties of output distributions of noisy, random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the "useless" uniform distribution. These bounds are tight with respect to…
A CNOT circuit is the key gadget for entangling qubits in quantum computing systems. However, the qubit connectivity of noisy intermediate-scale quantum (NISQ) devices is constrained by their {limited connectivity architecture}. To improve…
Rossman [In $\textit{Proc. $34$th Comput. Complexity Conf.}$, 2019] introduced the notion of $\textit{criticality}$. The criticality of a Boolean function $f : \{0,1\}^n \to \{0,1\}$ is the minimum $\lambda \geq 1$ such that for all…
Quantum error correction provides a path to large-scale quantum computers, but is built on challenging assumptions about the characteristics of the underlying errors. In particular, the mathematical assumption of independent errors in…
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided…
It is usually argued that the Standard Model predicts slow D^0-\bar D^0 oscillations with \Delta M_D, \Delta \Gamma_D < 10^{-3}*\Gamma_D$ and that New Physics can reveal itself through \Delta M_D exceeding 10^{-3}*\Gamma_D. It is believed…
In stochastic circuits, major sources of error are correlation errors, soft errors and random fluctuation errors that affect the accuracy and reliability of the circuit. The soft error has the effect of changing the correlation status and…
We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform…
In this paper, we initiate study of the computational power of adaptive and non-adaptive monotone decision trees - decision trees where each query is a monotone function on the input bits. In the most general setting, the monotone decision…
High Voltage Direct Current (HVDC) systems interconnect AC grids to increase reliability, connect offshore wind generation, and enable coupling of electricity markets. Considering the growing uncertainty in power infeed and the complexity…
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and…
We prove new lower bounds on the growth of robust quantum circuit complexity -- the minimal number of gates $C_{\delta}(U)$ to approximate a unitary $U$ up to an error of $\delta$ in operator norm distance. More precisely we show two bounds…
We study the ac conduction in a system of fermions or bosons strongly localised in a disordered array of sites with short-range interactions at frequencies larger than the intersite tunnelling but smaller than the characteristic fluctuation…
We study the problem of testing $C_k$-freeness ($k$-cycle-freeness) for fixed constant $k > 3$ in graphs with bounded arboricity (but unbounded degrees). In particular, we are interested in one-sided error algorithms, so that they must…
This brief examines the behavior of DC circuits comprised of resistively interconnected constant power devices, as may arise in DC microgrids containing micro-sources and constant power loads. We derive a sufficient condition for all…
We present optimized quantum circuits for GF$(2^m)$ multiplication and division operations, which are essential computing primitives in various quantum algorithms. Our ancilla-free GF multiplication circuit has the gate count complexity of…
We prove the strong converse for the $N$-source Gaussian multiple access channel (MAC). In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability less than one must lie…
Executing a logical quantum circuit fault-tolerantly incurs a large spacetime overhead. Recent work has proposed and investigated phantom codes, defined by the property that every in-block logical $\mathrm{CNOT}$ circuit can be implemented…
In this paper, we address sorting networks that are constructed from comparators of arity $k > 2$. That is, in our setting the arity of the comparators -- or, in other words, the number of inputs that can be sorted at the unit cost -- is a…