Related papers: Counting, Fanout, and the Complexity of Quantum AC…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
We investigate the fundamental expressivity limits of quantum reservoir computing (QRC) by establishing a formal connection to parametrized quantum circuit quantum machine learning (PQC-QML). We analytically prove, and numerically…
We construct a family of distributions $\{\mathcal{D}_n\}_n$ with $\mathcal{D}_n$ over $\{0, 1\}^n$ and a family of depth-$7$ quantum circuits $\{C_n\}_n$ such that $\mathcal{D}_n$ is produced exactly by $C_n$ with the all zeros state as…
A proof of quantumness (PoQ) allows a classical verifier to efficiently test if a quantum machine is performing a computation that is infeasible for any classical machine. In this work, we propose a new approach for constructing PoQ…
Quantum computing is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for quantum computing were designed with fault-tolerant hardware in…
Expressibility is a crucial factor of a Parameterized Quantum Circuit (PQC). In the context of Variational Quantum Algorithms (VQA) based Quantum Machine Learning (QML), a QML model composed of highly expressible PQC and sufficient number…
To implement useful quantum algorithms which demonstrate quantum advantage, we must scale currently demonstrated quantum computers up significantly. Leading platforms such as trapped ions face physical challenges in including more…
Executing quantum logic in cryogenic quantum computers requires a continuous energy supply from room-temperature control electronics. This dependence on external energy sources creates scalability limitations due to control channel density…
Computation is an input-output process, where a program encoding a problem to be solved is inserted into a machine that outputs a solution. Quantum computation conventionally relies on classical, external control outside the quantum…
In order to establish the computational equivalence between quantum Turing machines (QTMs) and quantum circuit families (QCFs) using Yao's quantum circuit simulation of QTMs, we previously introduced the class of uniform QCFs based on an…
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native…
Instruction scheduling is a key compiler optimization in quantum computing, just as it is for classical computing. Current schedulers optimize for data parallelism by allowing simultaneous execution of instructions, as long as their qubits…
The design and operation of a quantum-mechanical device as a laboratory instrument puts models written in equations of quantum mechanics in contact with instruments. This contact is recordable in files of a Classical Digital Process-control…
Large-scale quantum computation requires to be performed in the fault-tolerant manner. One crucial challenge of fault-tolerant quantum computing (FTQC) is reducing the overhead of implementing logical gates. Recently work proposed…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of…
We provide an $\Omega(log(n))$ lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can…
Quantum computing will change the way we tackle certain problems. It promises to dramatically speed-up many chemical, financial, and machine-learning applications. However, to capitalize on those promises, complex design flows composed of…
We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the…
For any function $f: X \times Y \to Z$, we prove that $Q^{*\text{cc}}(f) \cdot Q^{\text{OIP}}(f) \cdot (\log Q^{\text{OIP}}(f) + \log |Z|) \geq \Omega(\log |X|)$. Here, $Q^{*\text{cc}}(f)$ denotes the bounded-error communication complexity…