SearcharxivSearch

arXiv subjects

Carlos Pineda

Publications and source records attributed to Carlos Pineda.

At least 19 recordsLinked to original sources

The Geometry of Transport in Quantum Walks and Parrondo's Paradox

We study Parrondo's paradox -- the phenomenon where combining losing strategies yields a winning one -- in a minimal discrete-time quantum walk. We introduce the transport vector, encoded in the coin's steady state, whose inner product with the initial coin state gives the walker's asymptotic velocity. More generally, the paradox emerges exactly when the transport vector of the combined strategy falls outside the cone spanned by the individual ones -- a geometric criterion valid for any combination of strategies. It explains, for instance, why composing two coin operators within a single step can produce the paradox while simple alternation between them cannot, since alternation keeps the combined vector confined to the cone. The paradoxical set has nonzero measure, and we compute its probability explicitly in representative cases. This casts the paradox as one instance of designing reachable transport in quantum walks.

quant-ph

Integrable, Mixed, and Chaotic Dynamics in a Single All-to-All Ising Spin Model

We demonstrate that the Ising all-to-all (ATA) model exhibits a range of dynamics, from integrable to chaotic, including mixed behaviour across symmetry blocks within a single system. While other works have explored the dynamics of all-to-all systems by varying parameters, we analyse a fixed set of parameters and examine the dynamics within different blocks. In addition to investigating the dynamical properties, we show that the system remains resilient to noise when the norm of the Hamiltonian representing the noise is close to 1. Our results are presented by mapping each symmetry sector of the system to a kicked top (KT) and observing that KT parameters for each sector depend on its dimension. This system, similar to the Bunimovich billiard for classical chaos, provides a new platform for studying dynamics determined by the symmetry sector, advancing quantum chaos research.

quant-ph

Exploring quantum ergodicity of unitary evolution through the Krylov approach

In recent years, there has been growing interest in characterizing the complexity of quantum evolutions of interacting many-body systems. When a time-independent Hamiltonian governs the dynamics, Krylov complexity has emerged as a powerful tool. For unitary evolutions like kicked systems or Trotterized dynamics, a similar formulation based on the Arnoldi approach has been proposed yielding a new notion of quantum ergodicity [P. Suchsland, R. Moessner, and P. W. Claeys, Phys. Rev. B 111, 014309 (2025)]. In this work, we show that this formulation is robust for observing the transition from integrability to chaos in both autonomous and kicked systems. Examples from random matrix theory and spin chains are shown in this paper.

quant-ph

Coarse-grained dynamics in quantum many-body systems using the maximum entropy principle

Starting from a coarse-grained map of a quantum many-body system, we construct the inverse map that assigns a microscopic state to a coarse-grained state based on the maximum entropy principle. Assuming unitary evolution in the microscopic system, we examine the resulting dynamics in the coarse-grained system using the assignment map. We investigate both a two-qubit system, with \swap\ and controlled-\textsc{not}\ gates, and $n$-qubit systems, configured either in an Ising spin chain or with all-to-all interactions. We demonstrate that these dynamics exhibit atypical quantum behavior, such as nonlinearity and non-Markovianity. Furthermore, we find that these dynamics depend on the initial coarse-grained state and establish conditions for general microscopic dynamics under which linearity is preserved. As the effective dynamics induced by our coarse-grained description of many-body quantum systems diverge from conventional quantum behavior, we anticipate that this approach could aid in describing the quantum-to-classical transition and provide deeper insights into the effects of coarse graining on quantum systems.

quant-ph

Weyl channels for multipartite systems

Quantum channels, a subset of quantum maps, describe the unitary and non-unitary evolution of quantum systems. We study a generalization of the concept of Pauli maps to the case of multipartite high dimensional quantum systems through the use of the Weyl operators. The condition for such maps to be valid quantum channels, i.e. complete positivity, is derived in terms of Fourier transform matrices. From these conditions, we find the extreme points of this set of channels and identify an elegant algebraic structure nested within them. In turn, this allows us to expand upon the concept of "component erasing channels" introduced in earlier work by the authors. We show that these channels are completely characterized by elements drawn of finite cyclic groups. An algorithmic construction for such channels is presented and the smallest subsets of erasing channels which generate the whole set are determined.

quant-ph

Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation

Pauli channels are fundamental in the context of quantum computing as they model the simplest kind of noise in quantum devices. We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps (parametrized Pauli channels). A parametrized quantum circuit is employed to accommodate for dynamical maps. We also establish the mathematical conditions for an N-qubit transformation to be achievable using a parametrized circuit where only one single-qubit operation depends on the parameter. The implementation of the proposed circuit is demonstrated using IBM's quantum computers for the case of one qubit, and the fidelity of this implementation is reported.

quant-ph

Statistical analysis of word flow among five Indo-European languages

A recent increase in data availability has allowed the possibility to perform different statistical linguistic studies. Here we use the Google Books Ngram dataset to analyze word flow among English, French, German, Italian, and Spanish. We study what we define as ``migrant words'', a type of loanwords that do not change their spelling. We quantify migrant words from one language to another for different decades, and notice that most migrant words can be aggregated in semantic fields and associated to historic events. We also study the statistical properties of accumulated migrant words and their rank dynamics. We propose a measure of use of migrant words that could be used as a proxy of cultural influence. Our methodology is not exempt of caveats, but our results are encouraging to promote further studies in this direction.

cs.CL

Pauli component erasing quantum channels

Decoherence of quantum systems is described by quantum channels. However, a complete understanding of such channels, especially in the multi-particle setting, is still an ongoing difficult task. We propose the family of quantum maps that preserve or completely erase the components of a multi-qubit system in the basis of Pauli strings, which we call Pauli component erasing maps. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace, from which we derive several properties and complete the characterization. Moreover, we show that the obtained family of channels forms a semigroup and derive its generators. We use this simple structure to determine physical implementations and connect the obtained family of channels with Markovian processes.

quant-ph

Language statistics at different spatial, temporal, and grammatical scales

Statistical linguistics has advanced considerably in recent decades as data has become available. This has allowed researchers to study how statistical properties of languages change over time. In this work, we use data from Twitter to explore English and Spanish considering the rank diversity at different scales: temporal (from 3 to 96 hour intervals), spatial (from 3km to 3000+km radii), and grammatical (from monograms to pentagrams). We find that all three scales are relevant. However, the greatest changes come from variations in the grammatical scale. At the lowest grammatical scale (monograms), the rank diversity curves are most similar, independently on the values of other scales, languages, and countries. As the grammatical scale grows, the rank diversity curves vary more depending on the temporal and spatial scales, as well as on the language and country. We also study the statistics of Twitter-specific tokens: emojis, hashtags, and user mentions. These particular type of tokens show a sigmoid kind of behaviour as a rank diversity function. Our results are helpful to quantify aspects of language statistics that seem universal and what may lead to variations.

cs.CL

Statistical Properties of Rankings in Sports and Games

Any collection can be ranked. Sports and games are common examples of ranked systems: players and teams are constantly ranked using different methods. The statistical properties of rankings have been studied for almost a century in a variety of fields. More recently, data availability has allowed us to study rank dynamics: how elements of a ranking change in time. Here, we study the rank distributions and rank dynamics of twelve datasets from different sports and games. To study rank dynamics, we consider measures we have defined previously: rank diversity, change probability, rank entropy, and rank complexity. We also introduce a new measure that we call ``system closure'' that reflects how many elements enter or leave the rankings in time. We use a random walk model to reproduce the observed rank dynamics, showing that a simple mechanism can generate similar statistical properties as the ones observed in the datasets. Our results show that, while rank distributions vary considerably for different rankings, rank dynamics have similar behaviors, independently of the nature and competitiveness of the sport or game and its ranking method. Our results also suggest that our measures of rank dynamics are general and applicable for complex systems of different natures.

cs.SI

Fuzzy measurements and coarse graining in quantum many-body systems

Using the quantum map formalism, we provide a framework to construct fuzzy and coarse grained quantum states of many-body systems that account for limitations in the resolution of real measurement devices probing them. The first set of maps handles particle-indexing errors, while the second deals with the effects of detectors that can only resolve a fraction of the system constituents. We apply these maps to a spin-$1/2$ XX-chain obtaining a blurred picture of the entanglement generation and propagation in the system. By construction, both maps are simply related via a partial trace, which allow us to concentrate on the properties of the former. We fully characterize the fuzzy map, identifying its symmetries and invariants spaces. We show that the volume of the tomographically accessible states decreases at a double exponential rate in the number of particles, imposing severe bounds to the ability to read and use information of a many-body quantum system.

quant-ph

Dynamics of ranking

Virtually anything can be and is ranked; people, institutions, countries, words, genes. Rankings reduce complex systems to ordered lists, reflecting the ability of their elements to perform relevant functions, and are being used from socioeconomic policy to knowledge extraction. A century of research has found regularities when temporal rank data is aggregated. Far less is known, however, about how rankings change in time. Here we explore the dynamics of 30 rankings in natural, social, economic, and infrastructural systems, comprising millions of elements and timescales from minutes to centuries. We find that the flux of new elements determines the stability of a ranking: for high flux only the top of the list is stable, otherwise top and bottom are equally stable. We show that two basic mechanisms - displacement and replacement of elements - capture empirical ranking dynamics. The model uncovers two regimes of behavior; fast and large rank changes, or slow diffusion. Our results indicate that the balance between robustness and adaptability in ranked systems might be governed by simple random processes irrespective of system details.

physics.soc-ph

Identifying tax evasion in Mexico with tools from network science and machine learning

Mexico has kept electronic records of all taxable transactions since 2014. Anonymized data collected by the Mexican federal government comprises more than 80 million contributors (individuals and companies) and almost 7 billion monthly-aggregations of invoices among contributors between January 2015 and December 2018. This data includes a list of almost ten thousand contributors already identified as tax evaders, due to their activities fabricating invoices for non-existing products or services so that recipients can evade taxes. Harnessing this extensive dataset, we build monthly and yearly temporal networks where nodes are contributors and directed links are invoices produced in a given time slice. Exploring the properties of the network neighborhoods around tax evaders, we show that their interaction patterns differ from those of the majority of contributors. In particular, invoicing loops between tax evaders and their clients are over-represented. With this insight, we use two machine-learning methods to classify other contributors as suspects of tax evasion: deep neural networks and random forests. We train each method with a portion of the tax evader list and test it with the rest, obtaining more than 0.9 accuracy with both methods. By using the complete dataset of contributors, each method classifies more than 100 thousand suspects of tax evasion, with more than 40 thousand suspects classified by both methods. We further reduce the number of suspects by focusing on those with a short network distance from known tax evaders. We thus obtain a list of highly suspicious contributors sorted by the amount of evaded tax, valuable information for the authorities to further investigate illegal tax activity in Mexico. With our methods, we estimate previously undetected tax evasion in the order of \$10 billion USD per year by about 10 thousand contributors.

cs.SI

Position representation of single-mode Gaussian channels beyond the Gaussian functional form

We study one-mode Gaussian quantum channels in continuous-variable systems by performing a black-box characterization using complete positivity and trace preserving conditions, and report the existence of two subsets that do not have a functional Gaussian form. Our study covers as particular limit the case of singular channels, thus connecting our results with their known classification scheme based on canonical forms. Our full characterization of Gaussian channels without Gaussian functional form is completed by showing how Gaussian states are transformed under these operations, and by deriving the conditions for the existence of master equations for the non-singular cases. We show that although every functional form can be found in the vicinity of the identity, one of them does not parametrize unitary channels.

quant-ph

Divisibility of qubit channels and dynamical maps

The concept of divisibility of dynamical maps is used to introduce an analogous concept for quantum channels by analyzing the \textit{simulability} of channels by means of dynamical maps. In particular, this is addressed for Lindblad divisible, completely positive divisible and positive divisible dynamical maps. The corresponding L-divisible, CP-divisible and P-divisible subsets of channels are characterized (exploiting the results by Wolf et al., Comm. Math. Phys., 279(1):147-168, 2008) and visualized for the case of qubit channels. We discuss the general inclusions among divisibility sets and show several equivalences for qubit channels. To this end we study the conditions of L-divisibility for finite dimensional channels, especially the cases with negative eigenvalues, extending and completing the results of Phys. Rev. Lett., 101(15):150402, 2008. Furthermore we show that transitions between every two of the defined divisibility sets are allowed. We explore particular examples of dynamical maps to compare these concepts. Finally, we show that every divisible but not infinitesimal divisible qubit channel (in positive maps) is entanglement breaking, and open the question if something similar occurs for higher dimensions.

quant-ph

Quantum measurement optimization by decomposition of measurements into extremals

Using the convex structure of positive operator value measurements and of several quantities used in quantum metrology, such as quantum Fisher information or the quantum Van Trees information, we present an efficient numerical method to find the best strategy allowed by quantum mechanics to estimate a parameter. This method explores extremal measurements thus providing a significant advantage over previously used methods. We exemplify the method for different cost functions in a qubit and in a harmonic oscillator and find a strong numerical advantage when the desired target error is sufficiently small.

quant-ph

Rank-frequency distribution of natural languages: a difference of probabilities approach

The time variation of the rank $k$ of words for six Indo-European languages is obtained using data from Google Books. For low ranks the distinct languages behave differently, maybe due to syntaxis rules, whereas for $k>50$ the law of large numbers predominates. The dynamics of $k$ is described stochastically through a master equation governing the time evolution of its probability density, which is approximated by a Fokker-Planck equation that is solved analytically. The difference between the data and the asymptotic solution is identified with the transient solution, and good agreement is obtained.

physics.soc-ph

Rank dynamics of word usage at multiple scales

The recent dramatic increase in online data availability has allowed researchers to explore human culture with unprecedented detail, such as the growth and diversification of language. In particular, it provides statistical tools to explore whether word use is similar across languages, and if so, whether these generic features appear at different scales of language structure. Here we use the Google Books $N$-grams dataset to analyze the temporal evolution of word usage in several languages. We apply measures proposed recently to study rank dynamics, such as the diversity of $N$-grams in a given rank, the probability that an $N$-gram changes rank between successive time intervals, the rank entropy, and the rank complexity. Using different methods, results show that there are generic properties for different languages at different scales, such as a core of words necessary to minimally understand a language. We also propose a null model to explore the relevance of linguistic structure across multiple scales, concluding that $N$-gram statistics cannot be reduced to word statistics. We expect our results to be useful in improving text prediction algorithms, as well as in shedding light on the large-scale features of language use, beyond linguistic and cultural differences across human populations.

physics.soc-ph