arXiv subjects

Rolando Somma

Publications and source records attributed to Rolando Somma.

12 recordsLinked to original sources

arXiv2026

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders

We present efficient quantum circuits that implement high-dimensional unitary irreducible representations (irreps) of $SU(n)$, where $n \ge 2$ is constant. For dimension $N$ and error $\epsilon$, the number of quantum gates in our circuits is polynomial in $\log(N)$ and $\log(1/\epsilon)$. Our construction relies on the Jordan-Schwinger representation, which allows us to realize irreps of $SU(n)$ in the Hilbert space of $n$ quantum harmonic oscillators. Together with a recent efficient quantum Hermite transform, which allows us to map the computational basis states to the eigenstates of the quantum harmonic oscillator, this allows us to implement these irreps efficiently. Our quantum circuits can be used to construct explicit Ramanujan quantum expanders, a longstanding open problem. They can also be used to fast-forward the evolution of certain quantum systems.

quant-ph↗

arXiv2014

Fast Quantum Methods for Optimization

Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the optimization problem into the preparation of a low-temperature thermal state of the system. Motivated by the quantum annealing method, we present three strategies to prepare the low-temperature state that exploit quantum mechanics in remarkable ways. We focus on implementations without uncontrolled errors induced by the environment. This allows us to rigorously prove a quantum advantage. The first strategy uses a classical-to-quantum mapping, where the equilibrium properties of a classical system in $d$ spatial dimensions can be determined from the ground state properties of a quantum system also in $d$ spatial dimensions. We show how such a ground state can be prepared by means of quantum annealing, including quantum adiabatic evolutions. This mapping also allows us to unveil some fundamental relations between simulated and quantum annealing. The second strategy builds upon the first one and introduces a technique called spectral gap amplification to reduce the time required to prepare the same quantum state adiabatically. If implemented on a quantum device that exploits quantum coherence, this strategy leads to a quadratic improvement in complexity over the well-known bound of the classical simulated annealing method. The third strategy is not purely adiabatic; instead, it exploits diabatic processes between the low-energy states of the corresponding quantum system. For some problems it results in an exponential speedup (in the oracle model) over the best classical algorithms.

quant-ph↗

arXiv2013

On the gap of Hamiltonians for the adiabatic simulation of quantum circuits

The time or cost of simulating a quantum circuit by adiabatic evolution is determined by the spectral gap of the Hamiltonians involved in the simulation. In "standard" constructions based on Feynman's Hamiltonian, such a gap decreases polynomially with the number of gates in the circuit, L. Because a larger gap implies a smaller cost, we study the limits of spectral gap amplification in this context. We show that, under some assumptions on the ground states and the cost of evolving with the Hamiltonians (which apply to the standard constructions), an upper bound on the gap of order 1/L follows. In addition, if the Hamiltonians satisfy a frustration-free property, the upper bound is of order 1/L^2. Our proofs use recent results on adiabatic state transformations, spectral gap amplification, and the simulation of continuous-time quantum query algorithms. They also consider a reduction from the unstructured search problem, whose lower bound in the oracle cost translates into the upper bounds in the gaps. The impact of our results is that improving the gap beyond that of standard constructions (i.e., 1/L^2), if possible, is challenging.

quant-ph↗

arXiv2011

Efficient quantum state tomography

Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes infeasible because the number of quantum measurements and the amount of computation required to process them grows exponentially in the system size. Here we show that we can do exponentially better than direct state tomography for a wide range of quantum states, in particular those that are well approximated by a matrix product state ansatz. We present two schemes for tomography in 1-D quantum systems and touch on generalizations. One scheme requires unitary operations on a constant number of subsystems, while the other requires only local measurements together with more elaborate post-processing. Both schemes rely only on a linear number of experimental operations and classical postprocessing that is polynomial in the system size. A further strength of the methods is that the accuracy of the reconstructed states can be rigorously certified without any a priori assumptions.

quant-ph↗

arXiv2010

Heralded Polynomial-Time Quantum State Tomography

We describe an algorithm for quantum state tomography that converges in polynomial time to an estimate, together with a rigorous error bound on the fidelity between the estimate and the true state. The result suggests that state tomography on large quantum systems may be much more feasible than the exponential size of state space suggests. In many situations, the correctness of the state estimate can be certified from the data alone, with no a priori assumptions on the form of the measured state.

quant-ph↗

arXiv2006

Efficient solvability of Hamiltonians and limits on the power of some quantum computational models

We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end. We show that these models can be efficiently simulated on a classical computer in time polynomial in the dimension of the algebra, regardless of the dimension of the Hilbert space where the algebra acts. Similar results hold for the computation of the expectation value of operators implemented by a gate-sequence. We introduce a Lie-algebraic notion of generalized mean-field Hamiltonians and show that they are efficiently ("exactly") solvable by means of a Jacobi-like diagonalization method. Our results generalize earlier ones on fermionic linear optics computation and provide insight into the source of the power of the conventional model of quantum computation.

quant-ph↗

arXiv2005

Generalization of entanglement to convex operational theories: Entanglement relative to a subspace of observables

We define what it means for a state in a convex cone of states on a space of observables to be generalized-entangled relative to a subspace of the observables, in a general ordered linear spaces framework for operational theories. This extends the notion of ordinary entanglement in quantum information theory to a much more general framework. Some important special cases are described, in which the distinguished observables are subspaces of the observables of a quantum system, leading to results like the identification of generalized unentangled states with Lie-group-theoretic coherent states when the special observables form an irreducibly represented Lie algebra. Some open problems, including that of generalizing the semigroup of local operations with classical communication to the convex cones setting, are discussed.

quant-ph↗

arXiv2004

Entanglement as an Observer-Dependent Concept: An Application to Quantum Phase Transitions

This paper addresses the following main question: Do we have a theoretical understanding of entanglement applicable to a full variety of physical settings? It is clear that not only the assumption of distinguishability, but also the few-subsystem scenario, are too narrow to embrace all possible physical settings. In particular, the need to go beyond the traditional subsystem-based framework becomes manifest when one tries to apply the conventional concept of entanglement to the physics of matter, since the constituents of a quantum many-body system are indistinguishable particles. We shall discuss here a notion of generalized entanglement, which can be applied to any operator language (fermions, bosons, spins, etc.) used to describe a physical system and which includes the conventional entanglement settings introduced to date in a unified fashion. This is realized by noticing that entanglement is an observer-dependent concept, whose properties are determined by the expectations of a distinguished set of observables without reference to a preferred subsystem decomposition, i.e., it depends on the physically relevant point of view. This viewpoint depends in turn upon the relationship between different sets of observables that determine our ability to control the system of interest. Indeed, the extent to which entanglement is present depends on the observables used to measure a system and describe its states. This represents a most conspicuous advantage as will be highlighted by the condensed-matter application we will discuss.

quant-ph↗

arXiv2004

Nature and Measure of Entanglement in Quantum Phase Transitions

Characterizing and quantifying quantum correlations in states of many-particle systems is at the core of a full understanding of phase transitions in matter. In this work, we continue our investigation of the notion of generalized entanglement [Barnum et al. Phys. Rev. A 68, 032308 (2003)] by focusing on a simple Lie-algebraic measure of purity of a quantum state relative to an observable set. For the algebra of local observables on multi-qubit systems, the resulting local purity measure is equivalent to a recently introduced global entanglement measure [Meyer and Wallach, J. Math. Phys. 43, 4273 (2002)]. In the condensed-matter setting, the notion of Lie-algebraic purity is exploited to identify and characterize the quantum phase transitions present in two exactly solvable models: the Lipkin-Meshkov-Glick model, and the spin-1/2 anisotropic XY model in a transverse magnetic field. For the latter, we argue that a natural fermionic observable-set arising after the Jordan-Wigner transformation, better characterizes the transition than alternative measures based on qubits. This illustrates the usefulness of going beyond the standard subsystem-based framework while providing a global disorder parameter for this model. Our results show how generalized entanglement leads to useful tools for distinguishing between the ordered and disordered phases in the case of broken symmetry quantum phase transitions. Additional implications and possible extensions of concepts to other systems of interest in condensed matter physics are also discussed.

quant-ph↗

arXiv2004

Entanglement beyond subsystems

We present a notion of generalized entanglement which goes beyond the conventional definition based on quantum subsystems. This is accomplished by directly defining entanglement as a property of quantum states relative to a distinguished set of observables singled out by Physics. While recovering standard entanglement as a special case, our notion allows for substantially broader generality and flexibility, being applicable, in particular, to situations where existing tools are not directly useful.

quant-ph↗

arXiv2003

A subsystem-independent generalization of entanglement

We introduce a generalization of entanglement based on the idea that entanglement is relative to a distinguished subspace of observables rather than a distinguished subsystem decomposition. A pure quantum state is entangled relative to such a subspace if its expectations are a proper mixture of those of other states. Many information-theoretic aspects of entanglement can be extended to the general setting, suggesting new ways of measuring and classifying entanglement in multipartite systems. By going beyond the distinguishable-subsystem framework, generalized entanglement also provides novel tools for probing quantum correlations in interacting many-body systems.

quant-ph↗

arXiv2003

Quantum Simulations of Physics Problems

If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical "questions" more efficiently. The existence of one-to-one mappings between different algebras of observables or between different Hilbert spaces allow us to represent and imitate any physical system by any other one (e.g., a bosonic system by a spin-1/2 system). We explain how these mappings can be performed showing quantum networks useful for the efficient evaluation of some physical properties, such as correlation functions and energy spectra.

quant-ph↗