Search

We propose a numerical method to efficiently compute quantum generating functions (QGF) for a wide class of observables in one-dimensional quantum systems at high temperature. We obtain high-accuracy estimates for the cumulants and reconstruct full counting statistics from the QGF. We demonstrate its potential on spin $S=1/2$ anisotropic Heisenberg chain, where we can reach time scales hitherto inaccessible to state-of-the-art classical and quantum simulations. Our results challenge the conjecture of the Kardar--Parisi--Zhang universality for isotropic integrable quantum spin chains., Comment: 7 pages, 3 figures plus Supporting Information

Phonocardiography has recently gained popularity in low-cost and remote monitoring, including passive fetal heart monitoring. Development for methods which analyse phonocardiographical data try to capitalize on this opportunity, and in recent years a multitude of such algorithms and models have been published. Although there is little to no standardization in these published algorithms and multiple parts of these models have to be reimplemented on a case-by-case basis. Datasets containing heart sound recordings also lack standardization in both data storage and labeling, especially in fetal phonocardiography. We are presenting a toolbox that can serve as a basis for a future standard framework for heart sound analysis. This toolbox contains some of the most widely used processing steps, and with these, complex analysis processes can be created. These functions can be individually tested. Due to the interdependence of the steps, we validated the current segmentation stage using a manually labeled fetal phonocardiogram dataset comprising 50 one-minute abdominal PCG recordings, which include 6,758 S1 and 6,729 S2 labels. Our results were compared to other common and available segmentation methods, peak detection with the Neurokit2 library, and the Hidden Semi-Markov Model by Springer et al. With a 30 ms tolerance our best model achieved a 97.1% F1 score and 10.8 +/- 7.9 ms mean absolute error for S1 detection. This detection accuracy outperformed all tested methods. With this a more accurate S2 detection method can be created as a multi-step process. After an accurate segmentation the extracted features should be representative of the selected segments, which allows for more accurate statistics or classification models. The toolbox contains functions for both feature extraction and statistics creation which are compatible with the previous steps., Comment: 25 pages, 11 figures, submitted to Open Source and Validated Computational Tools for Physiological Time Series Analysis, for associated program documentation, see https://pypcg-toolbox.readthedocs.io/en/latest/

A coloring of the edges of a graph $G$ in which every $K_{1,2}$ is totally multicolored is known as a proper coloring and a coloring of the edges of $G$ in which every $K_{1,2}$ and every $K_{2,2}$ is totally multicolored is called a B-coloring. In this paper, we establish that a planar graph with maximum degree $\Delta$ can be B-colored with $\max\{2\Delta,32\}$ colors. This is best-possible for large $\Delta$ because $K_{2,\Delta}$ requires $2\Delta$ colors. In addition, there is an example with $\Delta=4$ that requires $12$ colors. We also establish that an outerplanar graph with maximum degree $\Delta$ can be B-colored with $\max\{\Delta,6\}$ colors. This is almost best-possible because $\Delta$ colors are necessary and there is an example with $\Delta=4$ that requires $5$ colors., Comment: 15 pages, 4 figures

We call a proper edge coloring of a graph $G$ a B-coloring if every 4-cycle of $G$ is colored with four different colors. Let $q_B(G)$ denote the smallest number of colors needed for a B-coloring of $G$. Motivated by earlier papers on B-colorings, here we consider $q_B(G)$ for planar and outerplanar graphs in terms of the maximum degree $\Delta = \Delta(G)$. We prove that $q_B(G)\le 2\Delta+8$ for planar graphs, $q_B(G)\le 2\Delta$ for bipartite planar graphs and $q_B(G)\le \Delta+1$ for outerplanar graphs with $\Delta \ge 4$. We conjecture that, for $\Delta$ sufficiently large, $q_B(G)\le 2\Delta(G)$ for planar $G$ and $q_B(G)\le \Delta(G)$ for outerplanar $G$., Comment: 15 pages, 4 figures, to appear in Journal of Graph Theory

We prove the Geometric P=W conjecture in rank 3 on the three-punctured sphere. We describe the topology at infinity of the related character variety. We use asymptotic abelianization of harmonic bundles away from the ramification divisor and an equivariant approach near the branch points to find the WKB (also known as Liouville--Green or phase-integral) expansion of the involved maps. We analyze the Stokes phenomenon governing their behavior., Comment: 66 pages, 7 figures; v2: expanded Section 6

TU-games with utility functions are considered. Generalizations of the prenucleolus, essential coalitions and the core: the u-prenucleolus, u-essential coalitions and the u-core respectively are introduced. We show that u-essential coalitions form a characterisation set for the u-prenucleolus in case of games with nonempty u-core.

Dynamical Lie algebras (DLAs) have emerged as a valuable tool in the study of parameterized quantum circuits, helping to characterize both their expressiveness and trainability. In particular, the absence or presence of barren plateaus (BPs) -- flat regions in parameter space that prevent the efficient training of variational quantum algorithms -- has recently been shown to be intimately related to quantities derived from the associated DLA. In this work, we investigate DLAs for the quantum approximate optimization algorithm (QAOA), one of the most studied variational quantum algorithms for solving graph MaxCut and other combinatorial optimization problems. While DLAs for QAOA circuits have been studied before, existing results have either been based on numerical evidence, or else correspond to DLA generators specifically chosen to be universal for quantum computation on a subspace of states. We initiate an analytical study of barren plateaus and other statistics of QAOA algorithms, and give bounds on the dimensions of the corresponding DLAs and their centers for general graphs. We then focus on the $n$-vertex cycle and complete graphs. For the cycle graph we give an explicit basis, identify its decomposition into the direct sum of a $2$-dimensional center and a semisimple component isomorphic to $n-1$ copies of $su(2)$. We give an explicit basis for this isomorphism, and a closed-form expression for the variance of the cost function, proving the absence of BPs. For the complete graph we prove that the dimension of the DLA is $O(n^3)$ and give an explicit basis for the DLA.

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower bound for the number of permutations whose block transposition distance from the identity is at least $(n+1)/2$., Comment: 15 pages

The Unbounded Subset Sum (USS) problem is an NP-hard computational problem where the goal is to decide whether there exist non-negative integers $x_1, \ldots, x_n$ such that $x_1 a_1 + \ldots + x_n a_n = b$, where $a_1 < \cdots < a_n < b$ are distinct positive integers with $\text{gcd}(a_1, \ldots, a_n)$ dividing $b$. The problem can be solved in pseudopolynomial time, while specialized cases, such as when $b$ exceeds the Frobenius number of $a_1, \ldots, a_n$ simplify to a total problem where a solution always exists. This paper explores the concept of totality in USS. The challenge in this setting is to actually find a solution, even though we know its existence is guaranteed. We focus on the instances of USS where solutions are guaranteed for large $b$. We show that when $b$ is slightly greater than the Frobenius number, we can find the solution to USS in polynomial time. We then show how our results extend to Integer Programming with Equalities (ILPE), highlighting conditions under which ILPE becomes total. We investigate the diagonal Frobenius number, which is the appropriate generalization of the Frobenius number to this context. In this setting, we give a polynomial-time algorithm to find a solution of ILPE. The bound obtained from our algorithmic procedure for finding a solution almost matches the recent existential bound of Bach, Eisenbrand, Rothvoss, and Weismantel (2024)., Comment: 12 pages

We study the Hobby-McKenzie varieties that constitute a major class investigated thoroughly in the monograph The shape of congruence lattices by Kearnes and Kiss. We obtain new characterizations of the Hobby-McKenzie varieties via compatible reflexive ternary structures. Based on our findings, we prove that in the lattice of interpretability types of varieties, the filter of the interpretability types of Hobby-McKenzie varieties is prime., Comment: arXiv admin note: text overlap with arXiv:2307.12902

We propose protocols that probe manifestations of the mass-energy equivalence in an optical lattice clock (OLC) interrogated with spin coherent and entangled quantum states. To tune and uniquely distinguish the mass-energy equivalence effects (gravitational redshift and second order Doppler shift) in such setting, we devise a dressing protocol using an additional nuclear spin state. We then analyze the interplay between photon-mediated interactions and gravitational redshift and show that such interplay can lead to entanglement generation and frequency synchronization. In the regime where all atomic spins synchronize, we show the synchronization time depends on the initial entanglement of the state and can be used as a proxy of its metrological gain compared to a classical state. Our work opens new possibilities for exploring the effects of general relativity on quantum coherence and entanglement in OLC experiments., Comment: 7+17 pages, 4+6 figures

We propose a general approach to find an optimal representation of a quantum many body wave function for a given error margin via global fermionic mode optimization. The stationary point on a fixed rank matrix product state manifold is obtained via a joint optimization on the Grassman manifold [Phys. Rev. Lett. 117, 210402] together with swap gates controlled permutations. The minimization of the global quantity, the block entropy area, guarantees that the method fulfills all criteria with respect to partial derivatives. Numerical results via large scale density matrix renormalization group simulations on strongly correlated molecular systems and two-dimensional fermionic lattice models are discussed., Comment: 5 pages, 4 figures

The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While there exist several known sufficient conditions for $P$-stability, we don't know any useful necessary condition for it. We also do not have good insight of possible structure of $P$-stable degree sequence families. At first we will show that every known infinite $P$-stable degree sequence set, described by inequalities of the parameters $n, c_1, c_2, \Sigma$ (the sequence length, the maximum and minimum degrees and the sum of the degrees) is ,,fully graphic" meaning that every degree sequence from the region with an even degree sum, is graphic. Furthermore, if $\Sigma$ does not occur in the determining inequality, then the notions of $P$-stability and full graphicality will be proved equivalent. In turns, this equality provides a strengthening of the well-known theorem of Jerrum, McKay and Sinclair about $P$-stability, describing the maximal $P$-stable sequence set by $n, c_1, c_2$. Furthermore we conjecture that similar equivalences occur in cases if $\Sigma$ also part of the defining inequality., Comment: 23 pages, 1 figure

Bell sampling is a simple yet powerful measurement primitive that has recently attracted a lot of attention, and has proven to be a valuable tool in studying stabiliser states. Unfortunately, however, it is known that Bell sampling fails when used on qu\emph{d}its of dimension $d>2$. In this paper, we explore and quantify the limitations of Bell sampling on qudits, and propose new quantum algorithms to circumvent the use of Bell sampling in solving two important problems: learning stabiliser states and providing pseudorandomness lower bounds on qudits. More specifically, as our first result, we characterise the output distribution corresponding to Bell sampling on copies of a stabiliser state and show that the output can be uniformly random, and hence reveal no information. As our second result, for $d=p$ prime we devise a quantum algorithm to identify an unknown stabiliser state in $(\mathbb{C}^p)^{\otimes n}$ that uses $O(n)$ copies of the input state and runs in time $O(n^4)$. As our third result, we provide a quantum algorithm that efficiently distinguishes a Haar-random state from a state with non-negligible stabiliser fidelity. As a corollary, any Clifford circuit on qudits of dimension $d$ using $O(\log{n}/\log{d})$ auxiliary non-Clifford single-qudit gates cannot prepare computationally pseudorandom quantum states., Comment: 35 pages

Plasmonic nanoparticles embedded into a solid matrix could play crucial role in laser-matter interactions. In this study, excess energy creation was observed during the single-shot irradiation of a polymer matrix containing plasmonic gold nanorods, resonant to the laser wavelength, with a high intensity femtosecond laser pulse. This effect was manifested in a 7-fold rise in the crater volume for a 1.7-fold increase of the laser intensity, and was absent in the pure polymer without the gold doping. It occurred at laser intensities > 1.5 x 1017 W/cm2, being the vanishing threshold of plasma mirror formation, resulting in a more than 80% increase of the amount of laser light entering the target. This threshold was found to be critical for the plasmonic effect of gold nanoantennas tuned to the wavelength of the laser on the crater formation., Comment: 13 pages, 5 figures

Let $K$ be a nonempty finite subset of the Euclidean space $\mathbb{R}^k$ $(k\ge 2)$. We prove that if a function $f\colon \mathbb{R}^k\to \mathbb{C}$ is such that the sum of $f$ on every congruent copy of $K$ is zero, then $f$ vanishes everywhere. In fact, a stronger, weighted version is proved. As a corollary we find that every finite subset $K$ of $\mathbb{R}^k$ having at least two elements is a Jackson set; that is, no subset of $\mathbb{R}^k$ intersects every congruent copy of $K$ in exactly one point., Comment: 17 pages

Information propagation in the one-dimensional infinite temperature Hubbard model with a dissipative particle sink at the end of a semi-infinite chain is studied. In the strongly interacting limit, the two-site mutual information and the operator entanglement entropy exhibit a rich structure with two propagating information fronts and superimposed interference fringes. A classical reversible cellular automaton model quantitatively captures the transport and the slow, classical part of the correlations, but fails to describe the rapidly propagating information jet. The fast quantum jet resembles coherent free particle propagation, with the accompanying long-ranged interference fringes that are exponentially damped by short-ranged spin correlations in the many-body background., Comment: 5 pages, 3 figures, supplemental material included

Several previous works have addressed the inherent trade-off between allocating resources in the power and time domains to pilot and data signals in multiple input multiple output systems over block-fading channels. In particular, when the channel changes rapidly in time, channel aging degrades the performance in terms of spectral efficiency without proper pilot spacing and power control. Despite recognizing non-stationary stochastic processes as more accurate models for time-varying wireless channels, the problem of pilot spacing and power control in multi-antenna systems operating over non-stationary channels is not addressed in the literature. In this paper, we address this gap by introducing a refined first-order autoregressive model that exploits the inherent temporal correlations over non-stationary Rician aging channels. We design a multi-frame structure for data transmission that better reflects the non-stationary fading environment than previously developed single-frame structures. Subsequently, to determine optimal pilot spacing and power control within this multi-frame structure, we develop an optimization framework and an efficient algorithm based on maximizing a deterministic equivalent expression for the spectral efficiency, demonstrating its generality by encompassing previous channel aging results. Our numerical results indicate the efficacy of the proposed method in terms of spectral efficiency gains over the single frame structure.

We consider finite information structures, and quest for the answer of the question: What is the proper definition of prior? In the single player setting we conclude that a probability distribution is a prior if it is disintegrable, because this definition excludes money pump. In the multiplayer setting our analysis does not boil down to one proper notion of common prior (the multiplayer version of prior). The appropriate notion is a choice of the modeller in this setting. We consider three variants of money pump, each "defines" a notion of common prior. Furthermore, we also consider three variants of trade, each correspond to one of the money pump variants, hence to one of the common prior variants.

We introduce a relativized version of random Kripke's schema and show how it may be applied in the investigation of the expressive power of intuitionistic real algebra by interpreting second-order Heyting arithmetic in it., Comment: 7 pages

We show that the growth of a unimodular random rooted tree $(T,o)$ of degree bounded by $d$ always exists, assuming its upper growth passes the critical threshold $\sqrt{d-1}$. This complements Timar's work who showed the possible nonexistence of growth below this threshold. The proof goes as follows. By Benjamini-Lyons-Schramm, we can realize $(T,o)$ as the cluster of the root for some invariant percolation on the $d$-regular tree. Then we show that for such a percolation, the limiting exponent with which the lazy random walk returns to the cluster of its starting point always exists. We develop a new method to get this, that we call the 2-3-method, as the usual pointwise ergodic theorems do not seem to work here. We then define and prove the Cohen-Grigorchuk co-growth formula to the invariant percolation setting. This establishes and expresses the growth of the cluster from the limiting exponent, assuming we are above the critical threshold., Comment: 20 pages, 4 figure, subset of the previous version of arXiv:2205.06692 which we are splitting into three papers

Given a finite set of positive integers, $A$, and starting with a heap of $n$ chips, Alice and Bob alternate turns and on each turn a player chooses $x\in A$ with $x$ smaller or equal than the current number of chips and subtract $x$ chips from the heap. The game terminates when the current number of chips becomes smaller than $\min\{A\}$ and no moves are possible. The player who makes the last move is the winner. We can define $w^A(n)$ to be $1$ if Alice has a winning strategy with a starting heap of $n$ chips and $0$ if Bob has a winning strategy. By the Pigeonhole Principle, $w^A(n)$ becomes periodic, and it is easy to see that the period length is at most an exponential function of $\max\{A\}$. The typical period length is a linear function of $\max\{A\}$, and it is a long time open question if exponential period length is possible. We consider a slight modification of this game by introducing an initial seed $S$ that tells for the few initial numbers of chips whether the current or the opposite player is the winner. In this paper we show that the initial seed cannot change the period length of $w^A(n)$ if the size of $A$ is $1$ or $2$, but it can change the period length with $|A| \geq 3$. Further, we exhibit a class of sets $A$ of size $3$ and corresponding initial seeds such that the period length becomes a superpolynomial function of $\max\{A\}$., Comment: 36 pages, 8 figures; submitted to Discrete Mathematics

We call a pair of vertex-disjoint, induced subtrees of a rooted trees twins if they have the same counts of vertices by out-degrees. The likely maximum size of twins in a uniformly random, rooted Cayley tree of size $n\to\infty$ is studied. It is shown that the expected number of twins of size $(2+\delta)\sqrt{\log n\cdot\log\log n}$ approaches zero, while the expected number of twins of size $(2-\delta)\sqrt{\log n\cdot\log\log n}$ approaches infinity., Comment: 16 pages

A $3$-uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size $3$. The degree of a vertex in a hypergraph is the number of hyperedges incident with it. The degree sequence of a hypergraph is the sequence of the degrees of its vertices. The degree sequence problem for $3$-uniform hypergraphs is to decide if a $3$-uniform hypergraph exists with a prescribed degree sequence. Such a hypergraph is called a realization. Recently, Deza \emph{et al.} proved that the degree sequence problem for $3$-uniform hypergraphs is NP-complete. Some special cases are easy; however, polynomial algorithms have been known so far only for some very restricted degree sequences. The main result of our research is the following. If all degrees are between $\frac{2n^2}{63}+O(n)$ and $\frac{5n^2}{63}-O(n)$ in a degree sequence $D$, further, the number of vertices is at least $45$, and the degree sum can be divided by $3$, then $D$ has a $3$-uniform hypergraph realization. Our proof is constructive and in fact, it constructs a hypergraph realization in polynomial time for any degree sequence satisfying the properties mentioned above. To our knowledge, this is the first polynomial running time algorithm to construct a $3$-uniform hypergraph realization of a highly irregular and dense degree sequence.

We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art high performance computing infrastructures. We demonstrate for the two dimensional spinless fermion model and for the Hubbard model on torus geometry that altogether several orders of magnitude in computational time can be saved by performing calculations on an optimized basis and by utilizing hybrid CPU-multiGPU parallelization. At least an order of magnitude reduction in computational complexity results from mode optimization, while a further order of reduction in wall time is achieved by massive parallelization. Our results are measured directly in FLOP and seconds. A detailed scaling analysis of the obtained performance as a function of matrix ranks and as a function of system size up to $12\times 12$ lattice topology is discussed. Our CPU-multiGPU model also tremendously accelerates the calculation of the one- and two-particle reduced density matrices, which can be used to construct various order parameters and trace quantum phase transitions with high fidelity., Comment: 12 pages, 11 figures

We applied a data-driven approach that explores the usability of the NetMob 2023 dataset in modelling mobility patterns within an urban context. We combined the data with a highly suitable external source, the ENACT dataset, which provides a 1 km x 1km grid with estimates of the day and night population across Europe. We developed three sets of XGBoost models that predict the population in each 100m x 100m grid cell used in NetMob2023 based on the mobile data traffic of the 68 online services covered in the dataset, using the ENACT values as ground truth. The results suggest that the NetMob 2023 data can be useful for the estimation of the day and night population and grid cell level and can explain part of the dynamics of urban mobility., Comment: NetMob 2023 Conference

The time evolution of topological systems is an active area of interest due to their expected applications in fault-tolerant quantum computing. Here, we analyze the dynamics of a non-interacting spinless fermion chain in its topological phase, quenched out-of-equilibrium by a Hamiltonian belonging to the same symmetry class. Due to particle-hole symmetry, the bulk properties of the system remain intact throughout its evolution. However, the boundary properties may be drastically altered, with the initially localized Majorana edge modes extending across the chain. Up to a timescale $t^*$, identified by area-law behavior of the entanglement entropy, these extended edge modes are an example of exotic effects in topological systems out-of-equilibrium. Further, whilst local disorder can be utilized to preserve localization and increase $t^*$, we still identify non-trivial dynamics in the Majorana polarization and Loschmidt echo., Comment: 5+6 pages, 3+1 figures. Revised explanation for the regime for which our analysis is applicable, including updated figures and reference list