Searcharxiv⌕ Search

arXiv subjects

Giancarlo Camilo

Publications and source records attributed to Giancarlo Camilo.

16 recordsLinked to original sources
arXiv2026

A competitive NISQ and qubit-efficient solver for the LABS problem

Pauli Correlation Encoding (PCE) is as a qubit-efficient variational approach to combinatorial optimization problems. The method offers a polynomial reduction in qubit count and a super-polynomial suppression of barren plateaus. Here, we extend the PCE-based framework to solve the Low Autocorrelation Binary Sequences (LABS) problem, a notoriously hard problem often used as a benchmark for classical and quantum solvers. To illustrate this,we simulate two variants of the PCE quantum solver for LABS instances of up to $N=45$ binary variables: one with commuting and one with maximally non-commuting sets of Pauli operators. The simulations use $4$ qubits and a circuit Ansatz with a total of $30$ two-qubit gates. We benchmark our method against the state-of-the-art classical solver and other quantum schemes. We observe improved scaling in the total time to reach the exact solution, outperforming the best-performing classical heuristic while using only a fraction of the quantum resources required by other quantum approaches. In addition, we perform proof-of-principle demonstrations on IonQ's Forte quantum processor, showing that the final solution is resilient to noise. Our findings point at PCE-based solvers as a promising quantum-inspired classical heuristic for hard problems as well as a tool to reduce the resource requirements for actual quantum algorithms.

quant-ph↗
arXiv2026

Quantum optimization with exact geodesic transport

We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This features a parameter-optimal circuit ansatz which supersedes known quantum natural gradient methods by removing expensive estimations of the metric tensor and provably reducing gradient estimation costs by $62.5\%$. Moreover, the framework also naturally incorporates conjugate gradients as a built-in feature, giving an accelerated descent method with convergence guarantees that we dub exact geodesic transport with conjugate gradients. Numerical benchmarks against state-of-the-art variational methods for ground-state preparation of molecular Hamiltonians or $1$-dimensional spin chains (both with and without particle-number conservation) up to $n=16$ qubits show reductions of over one order of magnitude in the number of optimization steps, with global convergence even for degenerate cases and competitive quantum-resource scalings. In addition, we perform proof-of-principle demonstrations on IonQ's Forte quantum processor, showcasing deployment of pre-trained circuits for the $H_{3}^{+}$ molecule and experimental training for $H_{2}$. Our work enables quantum machine learning applications with shorter training runtime, with implications at the interface of quantum simulation, differential geometry, and optimal control theory.

quant-ph↗
arXiv2026

Compilation-informed probabilistic logical-error cancellation

The potential of quantum computers to outperform classical ones in practically useful tasks remains challenging in the near term due to scaling limitations and high error rates of current quantum hardware. While quantum error correction (QEC) offers a clear path towards fault tolerance, overcoming the scalability issues will take time. Early applications will likely rely on QEC combined with quantum error mitigation (QEM). We introduce a QEM scheme against both compilation errors and logical-gate noise that is circuit-, QEC code-, and compiler-agnostic. The scheme builds on quasi-probability methods and uses information about the circuit's gates' compilations to attain an unbiased estimation of noiseless expectation values incurring a constant sample-complexity overhead. Moreover, it features maximal circuit size and code distance both independent of the target precision, in contrast to strategies based on QEC alone. We formulate the mitigation procedure as a linear program, demonstrate its efficacy through numerical simulations, and illustrate it for estimating the Jones polynomials of knots. Our method significantly reduces quantum resource requirements for high-precision estimations, offering a practical route towards fault-tolerant quantum computation with precision-independent overheads for fixed circuit complexity and code distance.

quant-ph↗
arXiv2025

Quantum encoder for fixed Hamming-weight subspaces

We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree $k$. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies the gates that superpose the corresponding states with the correct amplitudes. An explicit compilation into CNOTs and single-qubit gates is presented, with the total CNOT-gate count of $\mathcal{O}(k\, d)$ provided in analytical form. In addition, we show how to load data in the binary basis by sequentially stacking encoders of different Hamming weights using $\mathcal{O}(d\,\log(d))$ CNOT gates. Moreover, using generalized RBS gates that mix states of different Hamming weights, we extend the construction to efficiently encode arbitrary sparse vectors. Experimentally, we perform a proof-of-principle demonstration of our scheme on a commercial trapped-ion quantum computer. We successfully upload a $q$-Gaussian probability distribution in the non-log-concave regime with $n = 6$ and $k = 2$. We also showcase how the effect of hardware noise can be alleviated by quantum error mitigation. Numerically, we show how our encoder can improve the performance of variational quantum algorithms for problems that include particle-preserving symmetries. Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained combinatorial optimizations.

quant-ph↗
arXiv2024

Randomized semi-quantum matrix processing

We present a hybrid quantum-classical framework for simulating generic matrix functions more amenable to early fault-tolerant quantum hardware than standard quantum singular-value transformations. The method is based on randomization over the Chebyshev approximation of the target function while keeping the matrix oracle quantum, and is assisted by a variant of the Hadamard test that removes the need for post-selection. The resulting statistical overhead is similar to the fully quantum case and does not incur any circuit depth degradation. On the contrary, the average circuit depth is shown to get smaller, yielding equivalent reductions in noise sensitivity, as explicitly shown for depolarizing noise and coherent errors. We apply our technique to partition-function estimation, linear system solvers, and ground-state energy estimation. For these cases, we prove advantages on average depths, including quadratic speed-ups on costly parameters and even the removal of the approximation-error dependence.

quant-ph↗
arXiv2024

Towards large-scale quantum optimization solvers with few qubits

We introduce a variational quantum solver for combinatorial optimizations over $m=\mathcal{O}(n^k)$ binary variables using only $n$ qubits, with tunable $k>1$. The number of parameters and circuit depth display mild linear and sublinear scalings in $m$, respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. This leads to unprecedented quantum-solver performances. For $m=7000$, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for $m=2000$, an experiment with $n=17$ trapped-ion qubits featured MaxCut approximation ratios estimated to be beyond the hardness threshold $0.941$. To our knowledge, this is the highest quality attained experimentally on such sizes. Our findings offer a novel heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near term quantum devices.

quant-ph↗
arXiv2021

On Factorizable S-matrices, Generalized TTbar, and the Hagedorn Transition

We study solutions of the Thermodynamic Bethe Ansatz equations for relativistic theories defined by the factorizable $S$-matrix of an integrable QFT deformed by CDD factors. Such $S$-matrices appear under generalized TTbar deformations of integrable QFT by special irrelevant operators. The TBA equations, of course, determine the ground state energy $E(R)$ of the finite-size system, with the spatial coordinate compactified on a circle of circumference $R$. We limit attention to theories involving just one kind of stable particles, and consider deformations of the trivial (free fermion or boson) $S$-matrix by CDD factors with two elementary poles and regular high energy asymptotics -- the "2CDD model". We find that for all values of the parameters (positions of the CDD poles) the TBA equations exhibit two real solutions at $R$ greater than a certain parameter-dependent value $R_*$, which we refer to as the primary and secondary branches. The primary branch is identified with the standard iterative solution, while the secondary one is unstable against iterations and needs to be accessed through an alternative numerical method known as pseudo-arc-length continuation. The two branches merge at the "turning point" $R_*$ (a square-root branching point). The singularity signals a Hagedorn behavior of the density of high energy states of the deformed theories, a feature incompatible with the Wilsonian notion of a local QFT originating from a UV fixed point, but typical for string theories. This behavior of $E(R)$ is qualitatively the same as the one for standard TTbar deformations of local QFT.

hep-th↗
arXiv2020

Complexity and Floquet dynamics: non-equilibrium Ising phase transitions

We study the time-dependent circuit complexity of the periodically driven transverse field Ising model using Nielsen's geometric approach. In the high-frequency driving limit the system is known to exhibit non-equilibrium phase transitions governed by the amplitude of the driving field. We analytically compute the complexity in this regime and show that it clearly distinguishes between the different phases, exhibiting a universal linear behavior at early times. We also evaluate the time averaged complexity, provide evidence of non-analytic behavior at the critical points, and discuss its origin. Finally, we comment on the freezing of quantum dynamics at specific configurations and on the use of complexity as a new tool to understand quantum phase transitions in Floquet systems.

quant-ph↗
arXiv2019

Circuit Complexity of Knot States in Chern-Simons theory

We compute an upper bound on the circuit complexity of quantum states in $3d$ Chern-Simons theory corresponding to certain classes of knots. Specifically, we deal with states in the torus Hilbert space of Chern-Simons that are the knot complements on the $3$-sphere of arbitrary torus knots. These can be constructed from the unknot state by using the Hilbert space representation of the $S$ and $T$ modular transformations of the torus as fundamental gates. The upper bound is saturated in the semiclassical limit of Chern-Simons theory. The results are then generalized for a family of multi-component links that are obtained by "Hopf-linking" different torus knots. We also use the braid word presentation of knots to discuss states on the punctured sphere Hilbert space associated with 2-bridge knots and links. The calculations present interesting number theoretic features related with continued fraction representations of rational numbers. In particular, we show that the minimization procedure defining the complexity naturally leads to regular continued fractions, allowing a geometric interpretation of the results in the Farey tesselation of the upper-half plane. Finally, we relate our discussion to the framework of path integral optimization by generalizing the original argument to non-trivial topologies.

hep-th↗
arXiv2019

Momentum-space entanglement after smooth quenches

We compute the total amount of entanglement produced between momentum modes at late times after a smooth mass quench in free bosonic and fermionic quantum field theories. The entanglement and Rényi entropies are obtained in closed form as a function of the parameters characterizing the quench protocol. For bosons, we show that the entanglement production is more significant for light modes and for fast quenches. In particular, infinitely slow or adiabatic quenches do not produce any entanglement. Depending on the quench profile, the decrease as a function of the quench rate $δt$ can be either monotonic or oscillating. In the fermionic case the situation is subtle and there is a critical value for the quench amplitude above which this behavior is changed and the entropies become peaked at intermediate values of momentum and of the quench rate. We also show that the results agree with the predictions of a Generalized Gibbs Ensemble and obtain explicitly its parameters in terms of the quench data.

hep-th↗
arXiv2018

On the Strong Subadditivity of the Rényi entropies for bosonic and fermionic Gaussian states

Recently, there has been a surge of interest in using Rényi entropies as quantifiers of correlations in many-body quantum systems. However, it is well known that in general these entropies do not satisfy the strong subadditivity inequality, which is a central property ensuring the positivity of correlation measures. In fact, in many cases they do not even satisfy the weaker condition of subadditivity. In the present paper we shed light on this subject by providing a detailed survey of Rényi entropies for bosonic and fermionic Gaussian states. We show that for bosons the Rényi entropies always satisfy subadditivity, but not necessarily strong subadditivity. Conversely, for fermions both do not hold in general. We provide the precise intervals of the Rényi index $α$ for which subadditivity and strong subadditivity are valid in each case.

cond-mat.stat-mech↗
arXiv2018

Evolution of complexity following a quantum quench in free field theory

Using a recent proposal of circuit complexity in quantum field theories introduced by Jefferson and Myers, we compute the time evolution of the complexity following a smooth mass quench characterized by a time scale $δt$ in a free scalar field theory. We show that the dynamics has two distinct phases, namely an early regime of approximately linear evolution followed by a saturation phase characterized by oscillations around a mean value. The behavior is similar to previous conjectures for the complexity growth in chaotic and holographic systems, although here we have found that the complexity may grow or decrease depending on whether the quench increases or decreases the mass, and also that the time scale for saturation of the complexity is of order $δt$ (not parametrically larger).

hep-th↗
arXiv2016

Expanding plasmas from Anti de Sitter black holes

We introduce a new foliation of AdS$_5$ black holes such that the conformal boundary takes the form of a $4$-dimensional FLRW spacetime with scale factor $a(t)$. The foliation employs Eddington-Finkelstein-like coordinates and is applicable to a large class of AdS black holes, supported by matter fields or not, considerably extending previous efforts in the literature. We argue that the holographic dual picture of a CFT plasma on a FLRW background provides an interesting prototype to study the nonequilibrium dynamics of expanding plasmas and use holographic renormalization to extract the renormalized energy-momentum tensor of the dual plasma. We illustrate the procedure for three black holes of interest, namely AdS-Schwarzschild, AdS-Gauss-Bonnet, and AdS-Reissner-Nordström. For the latter, as a by-product, we show that the nonequilibrium dynamics of a CFT plasma subject to a quench in the chemical potential (i.e., a time-dependent chemical potential) resembles a cosmological evolution with the scale factor $a(t)$ being inversely related to the quench profile.

hep-th↗
arXiv2016

Holographic quenches towards a Lifshitz point

We use the holographic duality to study quantum quenches of a strongly coupled CFT that drive the theory towards a non-relativistic fixed point with Lifshitz scaling. We consider the case of a Lifshitz dynamical exponent $z$ close to unity, where the non-relativistic field theory can be understood as a specific deformation of the corresponding CFT and, hence, the standard holographic dictionary can be applied. On the gravity side this amounts to finding a dynamical bulk solution which interpolates between AdS and Lishitz spacetimes as time evolves. We show that an asymptotically Lifshitz black hole is always formed in the final state. This indicates that it is impossible to reach the vacuum state of the Lifshitz theory from the CFT vacuum as a result of the proposed quenching mechanism. The nonequilibrium dynamics following the breaking of the relativistic scaling symmetry is also probed using both local and non-local observables. In particular, we conclude that the equilibration process happens in a top-down manner, i.e., the symmetry is broken faster for UV modes.

hep-th↗
arXiv2015

Holographic thermalization with a chemical potential from Born-Infeld electrodynamics

The problem of holographic thermalization in the framework of Einstein gravity coupled to Born-Infeld nonlinear electrodynamics is investigated. We use equal time two-point correlation functions and expectation values of Wilson loop operators in the boundary quantum field theory as probes of thermalization, which have dual gravity descriptions in terms of geodesic lengths and minimal area surfaces in the bulk spacetime. The full range of values of the chemical potential per temperature ratio on the boundary is explored. The numerical results show that the effect of the charge on the thermalization time is similar to the one obtained with Maxwell electrodynamics, namely the larger the charge the later thermalization occurs. The inverse Born-Infeld parameter, on the other hand, has the opposite effect: the more nonlinear the theory is, the sooner it thermalizes. We also study the thermalization velocity and how the parameters affect the phase transition point separating the thermalization process into an accelerating phase and a decelerating phase.

hep-th↗