GCGiancarlo Camilo

Giancarlo Camilo

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Giancarlo Camilo has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Towards large-scale quantum optimization solvers with few qubits

    by Marco Sciorilli, Lucas Borges, Taylor L. Patti, Diego García-Martín, Giancarlo Camilo, Anima Anandkumar, Leandro Aolita

    Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems 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. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.


  • Open Access

    Randomized semi-quantum matrix processing

    by Allan Tosta, Thais de Lima Silva, Giancarlo Camilo, Leandro Aolita


  • Complexity and Floquet dynamics: Nonequilibrium Ising phase transitions

    by Giancarlo Camilo, Daniel Teixeira

    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 nonequilibrium 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 nonanalytic 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 tool to understand quantum phase transitions in Floquet systems.


  • Open Access

    Circuit complexity of knot states in Chern-Simons theory

    by Giancarlo Camilo, Dmitry Melnikov, Fábio Novaes, Andrea Prudenziati

    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.


  • Open Access

    Momentum-space entanglement after smooth quenches

    by Daniel W. F. Alves, Giancarlo Camilo

    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\'enyi 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 $\delta 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.

  • Strong subadditivity of the Rényi entropies for bosonic and fermionic Gaussian states

    by Giancarlo Camilo, Gabriel T. Landi, Sebas Eliëns

    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.


  • Open Access

    Momentum-space entanglement after smooth quenches

    by Daniel W. F. Alves, Giancarlo Camilo


  • Open Access

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

    by Giancarlo Camilo, Gabriel T. Landi, Sebas Eliëns

    Recently, there has been a surge of interest in using R\'enyi 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\'enyi entropies for bosonic and fermionic Gaussian states. We show that for bosons the R\'enyi 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\'enyi index $\alpha$ for which subadditivity and strong subadditivity are valid in each case.

  • Open Access

    Evolution of complexity following a quantum quench in free field theory

    by Daniel W. F. Alves, Giancarlo Camilo

    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).