Related papers: Weighting gates in circuit complexity and holograp…
Quantum field theories of strongly interacting matter sometimes have a useful holographic description in terms of the variables of a gravitational theory in higher dimensions. This duality maps time dependent physics in the gauge theory to…
We present a static framework for analysing quantum routing protocols that we call the \textit{cost-vector formalism}. Here, quantum networks are recast as multi-graphs where edges represent two-qubit entanglement resources that…
Repeated projective measurements in unitary circuits can lead to an entanglement phase transition as the measurement rate is tuned. In this work, we consider a different setting in which the projective measurements are replaced by…
Quantum circuit simulation is crucial for the development of quantum algorithms, particularly given the high cost and noise limitations of physical quantum hardware. While full-state quantum circuit simulation is commonly employed for…
Treating the effects of a time-dependent classical dephasing environment during quantum logic operations poses a theoretical challenge, as the application of non-commuting control operations gives rise to both dephasing and depolarization…
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit…
We employ holography to calculate the quantum complexity of $T\bar{T}$-deformation, utilizing the complexity equals volume (CV) and the complexity equals action (CA) proposals within the bulk spacetime with a finite radius cutoff. We find…
The purpose of this work is to investigate the consequences of quantum gravity for the singularity problem. We study the higher-derivative terms that invariably appear in any quantum field theoretical model of gravity, handling them both…
This article proposes a formalism which unifies Hamiltonian simulation techniques from different fields. This formalism leads to a competitive method to construct the Hamiltonian simulation with a comprehensible, simple-to-implement circuit…
We propose that finite cutoff regions of holographic spacetimes represent quantum circuits that map between boundary states at different times and Wilsonian cutoffs, and that the complexity of those quantum circuits is given by the…
Fault tolerant quantum simulation via the phase estimation algorithm and qubitization has a T-gate count that scales proportionally to the 1-norm of the Hamiltonian, the cost of block encoding the Hamiltonian, and inversely proportionally…
We investigate notions of complexity of states in continuous quantum-many body systems. We focus on Gaussian states which include ground states of free quantum field theories and their approximations encountered in the context of the…
Circuit optimization is a fundamental task for practical applications of near-term quantum computers. In this work we address this challenge through the powerful lenses of tensor network theory. Our approach involves the full…
A quantum gate is realized by specific unitary transformations operating on states representing qubits. Considering a quantum system employed as an element in a quantum computing scheme, the task is therefore to enforce the pre-specified…
Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles…
In the model of a fermion field coupled to loop quantum gravity, we consider the Gauss and the Hamiltonian constraints. According to the explicit solutions to the Gauss constraint, the fermion spins and the gravitational spin networks…
Here we show that to quantize any lumped element circuit, the circuit geometry must be included in a mathematical model of either the circuit fluxes or the circuit charges. By geometry of the circuit, we refer to the so-called parasitic…
It remains an open question whether the apparent additional power of quantum computation derives inherently from quantum mechanics, or merely from the flexibility obtained by "lifting" Boolean functions to linear operators and evaluating…
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$. Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results…
We initiate the study of parameterized complexity of $\textsf{QMA}$ problems in terms of the number of non-Clifford gates in the problem description. We show that for the problem of parameterized quantum circuit satisfiability, there exists…