Related papers: Lorentzian threads and nonlocal computation in hol…
In this paper, we study the logarithmic terms in the partition functions of CFTs with boundaries (BCFTs). In three dimensions, their coefficients give the boundary central charges, which are conjectured to be monotonically decreasing…
We study three different types of local quenches (local operator, splitting and joining) in both the free fermion and holographic CFTs in two dimensions. We show that the computation of a quantity called entanglement density, provides a…
Hypergraphs provide a powerful framework for modeling complex systems and networks with higher-order interactions beyond simple pairwise relationships. However, graph-based clustering approaches, which focus primarily on pairwise relations,…
Consider a set of $N$ systems and an arbitrary interaction Hamiltonian $H$ that couples them. We investigate the use of local operations and classical communication (LOCC), together with the Hamiltonian $H$, to simulate a unitary evolution…
Continuous-variable (CV) quantum computing has shown great potential for building neural network models. These neural networks can have different levels of quantum-classical hybridization depending on the complexity of the problem. Previous…
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non-local Hamiltonian simulation and non-local gate synthesis when only homogeneous local unitaries are performed in…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
An important window to quantum gravity phenomena in low energy noncommutative (NC) quantum field theories (QFTs) gets represented by a specific form of UV/IR mixing. Yet another important window to quantum gravity, a holography, manifests…
In machine learning it is common to interpret each data point as a vector in Euclidean space. However the data may actually be functional i.e.\ each data point is a function of some variable such as time and the function is discretely…
While the circuit model of quantum computation defines its logical depth or "computational time" in terms of temporal gate sequences, the measurement-based model could allow totally different temporal ordering and parallelization of logical…
Large scale numerical experiments are commonplace today in theoretical physics. The high performance algorithms described herein are the most compact, efficient methods known for representing and analyzing systems modeled well by sets or…
We extend the framework of general boundary quantum field theory (GBQFT) to achieve a fully local description of realistic quantum field theories. This requires the quantization of non-K\"ahler polarizations which occur generically on…
Hole-ography is a prescription relating the areas of surfaces in an AdS bulk to the differential entropy of a family of intervals in the dual CFT. In (2+1) bulk dimensions, or in higher dimensions when the bulk features a sufficient degree…
We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This…
We study the evolution of holographic complexity in various AdS/CFT models containing cosmological crunch singularities. We find that a notion of complexity measured by extremal bulk volumes tends to decrease as the singularity is…
In universal fault-tolerant quantum computing, implementing logical non-Clifford gates often demands substantial spacetime resources for many error-correcting codes, including the high-threshold surface code. A critical mission for…
I introduce a family of closeness functions between causal Lorentzian geometries of finite volume and arbitrary underlying topology. When points are randomly scattered in a Lorentzian manifold, with uniform density according to the volume…
We discuss the Carleman approach to the quantum simulation of classical fluids, as applied to i) Lattice Boltzmann (CLB), ii) Navier-Stokes (CNS) and iii) Grad (CG) formulations of fluid dynamics. CLB shows excellent convergence properties,…
Local clustering aims to find a compact cluster near the given starting instances. This work focuses on graph local clustering, which has broad applications beyond graphs because of the internal connectivities within various modalities.…
A fundamental problem of fault-tolerant quantum computation with quantum low-density parity-check (qLDPC) codes is the tradeoff between connectivity and universality. It is widely believed that in order to perform native logical…