Search

To avoid prohibitive overheads in performing fault-tolerant quantum computation, the decoding problem needs to be solved accurately and at speeds sufficient for fast feedback. Existing decoding systems fail to satisfy both of these requirements, meaning they either slow down the quantum computer or reduce the number of operations that can be performed before the quantum information is corrupted. We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. Further, it comprises an adaptivity engine that allows the decoder to update itself in real-time in response to control signals, such as heralded leakage events. Under a realistic circuit-level noise model where leakage is a dominant error source, our decoder enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding. This is achieved whilst decoding in under 1 us per round with modest FPGA resources, demonstrating that high-accuracy real-time decoding is possible, and reducing the qubit counts required for large-scale fault-tolerant quantum computation.

The study of matroid products traces back to the 1970s, when Lov\'asz and Mason studied the existence of various types of matroid products with different strengths. Among these, the tensor product is arguably the most important, which can be considered as an extension of the tensor product from linear algebra. However, Las Vergnas showed that the tensor product of two matroids does not always exist. Over the following four decades, matroid products remained surprisingly underexplored, regaining attention only in recent years due to applications in tropical geometry and the limit theory of matroids. In this paper, inspired by the concept of coupling in probability theory, we introduce the notion of coupling for matroids -- or, more generally, for submodular set functions. This operation can be viewed as a relaxation of the tensor product. Unlike the tensor product, however, we prove that a coupling always exists for any two submodular functions and can be chosen to be increasing if the original functions are increasing. As a corollary, we show that two matroids always admit a matroid coupling, leading to a novel operation on matroids. Our construction is algorithmic, providing an oracle for the coupling matroid through a polynomial number of oracle calls to the original matroids. We apply this construction to derive new necessary conditions for matroid representability and establish connection between tensor products and Ingleton's inequality. Additionally, we verify the existence of set functions that are universal with respect to a given property, meaning any set function over a finite domain with that property can be obtained as a quotient., Comment: 24 pages

Quantum error correction (QEC) will be essential to achieve the accuracy needed for quantum computers to realise their full potential. The field has seen promising progress with demonstrations of early QEC and real-time decoded experiments. As quantum computers advance towards demonstrating a universal fault-tolerant logical gate set, implementing scalable and low-latency real-time decoding will be crucial to prevent the backlog problem, avoiding an exponential slowdown and maintaining a fast logical clock rate. Here, we demonstrate low-latency feedback with a scalable FPGA decoder integrated into the control system of a superconducting quantum processor. We perform an 8-qubit stability experiment with up to $25$ decoding rounds and a mean decoding time per round below $1$ ${\mu}s$, showing that we avoid the backlog problem even on superconducting hardware with the strictest speed requirements. We observe logical error suppression as the number of decoding rounds is increased. We also implement and time a fast-feedback experiment demonstrating a decoding response time of $9.6$ ${\mu}s$ for a total of $9$ measurement rounds. The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments that go beyond purely keeping logical qubits alive and into demonstrating building blocks of fault-tolerant computation, such as lattice surgery and magic state teleportation., Comment: 11 pages, 4 figures, Supplementary Information

Whether to reset qubits, or not, during quantum error correction experiments is a question of both foundational and practical importance for quantum computing. Text-book quantum error correction demands that qubits are reset after measurement. However, fast qubit reset has proven challenging to execute at high fidelity. Consequently, many cutting-edge quantum error correction experiments are opting for the no-reset approach, where physical reset is not performed. It has recently been postulated that no-reset is functionally equivalent to reset procedures, as well as being faster and easier. For memory experiments, we confirm numerically that resetting provides no benefit. On the other hand, we identify a remarkable difference during logical operations. We find that unconditionally resetting qubits can reduce the duration of fault-tolerant logical operation by up to a factor of two as the number of measurement errors that can be tolerated is doubled. We support this with numerical simulations. However, our simulations also reveal that the no-reset performance is superior if the reset duration or infidelity exceeds a given threshold. Lastly, we introduce two novel syndrome extraction circuits that can reduce the time overhead of no-reset approaches. Our findings provide guidance on how experimentalists should design future experiments., Comment: 12 pages, 14 figures, 1 table

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they found applications in the theory of finitely additive measures, nonlinear integrals, and electric capacities. Recently, a number of connections between these two branches have been established, and the aim of this paper is to generalize further results on submodular set functions on finite sets to the analytic setting. We first extend the notion of duality of matroids to submodular set functions, and characterize the uniquely determined decomposition of a submodular set function into the sum of a nonnegaive charge and an increasing submodular set function in which the charge is maximal. Then, we describe basic properties of infinite-alternating set functions, a subclass of submodular set functions that serves as an analytic counterpart of coverage functions. By relaxing the monotonicity assumption in the definition, we introduce a new class of submodular functions with distinguished structural properties that includes, among others, weighted cut functions of graphs. We prove that, unlike general submodular set functions over an infinite domain, any infinite-alternating set function can be written as the sum of an increasing and a decreasing submodular function or as the difference of two increasing submodular functions, thus giving extension of results on monotonic decompositions in the finite case. Finally, motivated by its connections to graph parameters such as the maximum size of a cut and the maximum size of a fractional triangle packing, we study the structure of such decompositions for weighted cut functions of undirected graphs., Comment: 26 pages

Leakage from the computational subspace is a damaging source of noise that degrades the performance of most qubit types. Unlike other types of noise, leakage cannot be overcome by standard quantum error correction techniques and requires dedicated leakage reduction units. In this work, we study the effects of leakage mobility between superconducting qubits on the performance of a quantum stability experiment, which is a benchmark for fault-tolerant logical computation. Using the Fujitsu Quantum Simulator, we perform full density-matrix simulations of stability experiments implemented on the surface code. We observe improved performance with increased mobility, suggesting leakage mobility can itself act as a leakage reduction unit by naturally moving leakage from data to auxiliary qubits, where it is removed upon reset. We compare the performance of standard error-correction circuits with "patch wiggling", a specific leakage reduction technique where data and auxiliary qubits alternate their roles in each round of error correction. We observe that patch wiggling becomes inefficient with increased leakage mobility, in contrast to the improved performance of standard circuits. These observations suggest that the damage of leakage can be overcome by stimulating leakage mobility between qubits without the need for a dedicated leakage reduction unit., Comment: 6+4 pages, 3+4 figures

Floquet codes are an intriguing generalisation of stabiliser and subsystem codes, which can provide good fault-tolerant characteristics while benefiting from reduced connectivity requirements in hardware. A recent question of interest has been how to run Floquet codes on devices which have defective -- and therefore unusable -- qubits. This is an under-studied issue of crucial importance for running such codes on realistic hardware. To address this challenge, we introduce a new method of accommodating defective qubits on a wide range of two-dimensional Floquet codes, which requires no additional connectivity in the underlying quantum hardware, no modifications to the original Floquet code's measurement schedule, can accommodate boundaries, and is optimal in terms of the number of qubits and stabilisers removed. We numerically demonstrate that, using this method, the planar honeycomb code is fault tolerant up to a fabrication defect probability of $\approx 12\%$. We find the fault-tolerant performance of this code under defect noise is competitive with that of the surface code, despite its sparser connectivity. We finally propose multiple ways this approach can be adapted to the underlying hardware, through utilising any additional connectivity available, and treating defective auxiliary qubits separately to defective data qubits. Our work therefore serves as a guide for the implementation of Floquet codes in realistic quantum hardware., Comment: 37 pages, 22 figures, minor updates based on referee comments

In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are looking for an `unavoidable' set of colorings of a finite configuration, that is a set of colorings with the property that one of them always appears in any coloring of the space. This set definitely includes the monochromatic and the rainbow colorings. In the present paper, we prove the following two results of this type. First, for any acute triangle $T$, and any coloring of $\mathbb{R}^3$, there is either a monochromatic or a rainbow copy of $T$. Second, for every $m$, there exists a sufficiently large $n$ such that in any coloring of $\mathbb{R}^n$, there exists either a monochromatic or a rainbow $m$-dimensional unit hypercube. In the maximum norm, $\ell_{\infty}$, we have a much stronger statement. For every finite $M$, there exits an $n$ such that in any coloring of $\mathbb{R}_\infty^n$, there is either a monochromatic or a rainbow isometric copy of $M$., Comment: 9 pages, 3 figures

The diameter of a directed graph is a fundamental parameter defined as the maximum distance realized among the pairs of vertices. As graphs of small diameter are of interest in many applications, we study the following problem: for a given directed graph and a positive integer $d$, what is the minimum number of arc flips (also known as arc reversal) required to obtain a graph with diameter at most $d$? It is a generalization of the well-known problem \textsc{Oriented Diameter}, first studied by Chv\'atal and Thomassen. Here we investigate variants of the above problem, considering the number of flips and the target diameter as parameters. We prove that most of the related questions of this type are hard. Special cases of graphs are also considered, as planar and cactus graphs, where we give polynomial time algorithms., Comment: 14 pages, 3 figures

We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical $X$ and $Z$ strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a $SWAP$-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper [McEwen, Bacon, and Gidney, Quantum 7, 1172 (2023)] can be constructed., Comment: 26 pages, 18 figures Slight updates based on referee comments, and fixed typo in Figure 11

A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n - 3}\rfloor$ edges. Recently his conjecture was settled by Lavoll\'ee and Swanepoel. In this paper we consider $1$-planar unit distance graphs. We say that a graph is a $1$-planar unit distance graph if it can be drawn in the plane such that all edges are drawn as unit distance line segments while each of them are involved in at most one crossing. We show that such graphs on $n$ vertices can have at most $3n-\sqrt[4]{n}/10$ edges., Comment: 10 pages, 4 figures

We prove that for any $\ell_p$-norm in the plane with $1

We study the structure of isometries of the quadratic Wasserstein space $\mathcal{W}_2\left(\mathbb{S}^n,\|\cdot\|\right)$ over the sphere endowed with the distance inherited from the norm of $\mathbb{R}^{n+1}$. We prove that $\mathcal{W}_2\left(\mathbb{S}^n,\|\cdot\|\right)$ is isometrically rigid, meaning that its isometry group is isomorphic to that of $\left(\mathbb{S}^n,\|\cdot\|\right)$. This is in striking contrast to the non-rigidity of its ambient space $\mathcal{W}_2\left(\mathbb{R}^n,\|\cdot\|\right)$ but in line with the rigidity of the geodesic space $\mathcal{W}_2\left(\mathbb{S}^n,\sphericalangle\right)$. One of the key steps of the proof is the use of mean squared error functions to mimic displacement interpolation in $\mathcal{W}_2\left(\mathbb{S}^n,\|\cdot\|\right)$. A major difficulty in proving rigidity for quadratic Wasserstein spaces is that one cannot use the Wasserstein potential technique. To illustrate its general power, we use it to prove isometric rigidity of $\mathcal{W}_p\left(\mathbb{S}^1, \|\cdot\|\right)$ for $1 \leq p<2.$, Comment: v2: accepted manuscript version; 16 pages, 1 figure

Quantum computers have the potential to change the way we solve computational problems. Due to the noisy nature of qubits, the need arises to correct physical errors occurring during computation. The surface code is a promising candidate for such error correction that shows high threshold and which can store a logical quantum state on hardware with square-grid connectivity, a type of device that already exists. However, for logical quantum computation, the measurement of some irregular, non-local stabilisers is required, and it is not currently known how to do this without modifying the connectivity of the hardware. Here, we present a method to achieve this, closing this gap on the path to fault-tolerant quantum computation. We introduce a method of tangled syndrome extraction circuits, which enables measurement of observables between distant qubits. As an application of our tangling technique, we show how to measure the aforementioned irregular non-local stabilisers, without physically modifying the hardware itself. We present a concrete scheme that enables general lattice surgery with the planar code. Therefore, tangling enables fault-tolerant logical quantum computation using the surface code on square-grid connectivity architectures., Comment: 36 pages, 26 figures. Main changes: Added 2 more figures, added more explanation in some sections

A number of exciting recent results have been seen in the field of quantum error correction. These include initial demonstrations of error correction on current quantum hardware, and resource estimates which improve understanding of the requirements to run large-scale quantum algorithms for real-world applications. In this work, we bridge the gap between these two developments by performing careful estimation of the resources required to fault-tolerantly perform quantum phase estimation (QPE) on a minimal chemical example. Specifically, we describe a detailed compilation of the QPE circuit to lattice surgery operations for the rotated surface code, for a hydrogen molecule in a minimal basis set. We describe a number of optimisations at both the algorithmic and error correction levels. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds, emphasising the need for improved error correction techniques specifically targeting the early fault-tolerant regime., Comment: 24 pages, 24 figures, 2 tables, source code available at https://github.com/riverlane/h2_compilation/

In quantum mechanics, the well-known Loewner order expresses that one observable's expectation value is less than or equal than that of another with respect to all quantum states. In this paper we propose and study a similar order relation in terms of the variance, and we prove two theorems. Our first result states that one observable's variance is less than or equal than that of another with respect to all quantum states if and only if the former is a $1$-Lipschitz function of the latter. The other main result we prove characterises the order automorphisms with respect to this proposed order relation. It turns out that in some sense these automorphisms have a more rigid form than in the case of the Loewner order., Comment: Accepted for publication in Int. Math. Res. Not. IMRN

The famous Hadwiger-Nelson problem asks for the minimum number of colors needed to color the points of the Euclidean plane so that no two points unit distance apart are assigned the same color. In this note we consider a variant of the problem in Minkowski metric planes, where the unit circle is a regular polygon of even and at most 22 vertices. We present a simple lattice-sublattice coloring scheme that uses 6 colors, proving that the chromatic number of the Minkowski planes above are at most 6. This result is new for regular polygons having more than 8 vertices., Comment: 15 pages, 12 figures

We study generic properties of topological groups in the sense of Baire category. First we investigate countably infinite (discrete) groups. We extend a classical result of B. H. Neumann, H. Simmons and A. Macintyre on algebraically closed groups and the word problem. I. Goldbring, S. E. Kunnawalkam and Y. Lodha proved that every isomorphism class is meager among countably infinite (discrete) groups. In contrast, we show that there is a comeager isomorphism class among countably infinite (discrete) abelian groups. Then we turn to compact metrizable abelian groups. We use Pontryagin duality to show that there is a comeager isomorphism class among compact metrizable abelian groups. We discuss its connections to the countably infinite (discrete) case. Finally, we study compact metrizable groups. We prove that the generic compact metrizable group is neither connected nor totally disconnected; also it is neither torsion-free nor a torsion group., Comment: arXiv admin note: text overlap with arXiv:2110.15902

We describe Wasserstein isometries of the quantum bit state space with respect to distinguished cost operators. We derive a Wigner-type result for the cost operator involving all the Pauli matrices: in this case, the isometry group consists of unitary or anti-unitary conjugations. In the Bloch sphere model, this means that the isometry group coincides with the classical symmetry group $\mathbf{O}(3).$ On the other hand, for the cost generated by the qubit "clock" and "shift" operators, we discovered non-surjective and non-injective isometries as well, beyond the regular ones. This phenomenon mirrors certain surprising properties of the quantum Wasserstein distance., Comment: 18 pages, 3 figures. v2: new references added, v3: minor changes

We prove isometric rigidity for $p$-Wasserstein spaces over finite-dimensional tori and spheres for all $p$. We present a unified approach to proving rigidity that relies on the robust method of recovering measures from their Wasserstein potentials.

Countably infinite groups (with a fixed underlying set) constitute a Polish space $G$ with a suitable metric, hence the Baire category theorem holds in $G$. We study isomorphism invariant subsets of $G$, which we call group properties. We say that the generic countably infinite group is of property $P$ if $P$ is comeager in $G$. We prove that every group property with the Baire property is either meager or comeager. We show that there is a comeager elementary equivalence class in $G$ but every isomorphism class is meager. We prove that the generic group is algebraically closed, simple, not finitely generated and not locally finite. We show that in the subspace of Abelian groups the generic group is isomorphic to the unique countable, divisible torsion group that contains every finite Abelian group. We sketch the model-theoretic setting in which many of our results can be generalized. We briefly discuss a connection with infinite games., Comment: We have very recently become aware of the fact that another research group is working on very similar problems, see arXiv:2006.14048

Let $H$ be a Hilbert space and $P(H)$ be the projective space of all quantum pure states. Wigner's theorem states that every bijection $\phi\colon P(H)\to P(H)$ that preserves the quantum angle between pure states is automatically induced by either a unitary or an antiunitary operator $U\colon H\to H$. Uhlhorn's theorem generalises this result for bijective maps $\phi$ that are only assumed to preserve the quantum angle $\frac{\pi}{2}$ (orthogonality) in both directions. Recently, two papers, written by Li--Plevnik--\v{S}emrl and Geh\'er, solved the corresponding structural problem for bijections that preserve only one fixed quantum angle $\alpha$ in both directions, provided that $0 < \alpha \leq \frac{\pi}{4}$ holds. In this paper we solve the remaining structural problem for quantum angles $\alpha$ that satisfy $\frac{\pi}{4} < \alpha < \frac{\pi}{2}$, hence complete a programme started by Uhlhorn. In particular, it turns out that these maps are always induced by unitary or antiunitary operators, however, our assumption is much weaker than Wigner's., Comment: 16 pages, 4 figures

Motivated by Kloeckner's result on the isometry group of the quadratic Wasserstein space $\mathcal{W}_2\left(\mathbb{R}^n\right)$, we describe the isometry group $\mathrm{Isom}\left(\mathcal{W}_p (E)\right)$ for all parameters $0 < p < \infty$ and for all separable real Hilbert spaces $E.$ In particular, we show that $\mathcal{W}_p(X)$ is isometrically rigid for all Polish space $X$ whenever $01$, by solving Kloeckner's problem affirmatively on the existence of mass-splitting isometries., Comment: 30 pages, 2 figures. v2: minor changes

The Hilbert space effect algebra is a fundamental mathematical structure which is used to describe unsharp quantum measurements in Ludwig's formulation of quantum mechanics. Each effect represents a quantum (fuzzy) event. The relation of coexistence plays an important role in this theory, as it expresses when two quantum events can be measured together by applying a suitable apparatus. This paper's first goal is to answer a very natural question about this relation, namely, when two effects are coexistent with exactly the same effects? The other main aim is to describe all automorphisms of the effect algebra with respect to the relation of coexistence. In particular, we will see that they can differ quite a lot from usual standard automorphisms, which appear for instance in Ludwig's theorem. As a byproduct of our methods we also strengthen a theorem of Molnar.

In this paper we consider the cone of all positive, bounded operators acting on an infinite dimensional, complex Hilbert space, and examine bijective maps that preserve absolute continuity in both directions. It turns out that these maps are exactly those that preserve singularity in both directions. Moreover, in some weak sense, such maps are always induced by bounded, invertible, linear- or conjugate linear operators of the underlying Hilbert space. Our result gives a possible generalization of a recent theorem of Molnar which characterizes maps on the positive cone that preserve the Lebesgue decomposition of operators.

Recently Kloeckner described the structure of the isometry group of the quadratic Wasserstein space $\mathcal{W}_2\left(\mathbb{R}^n\right)$. It turned out that the case of the real line is exceptional in the sense that there exists an exotic isometry flow. Following this line of investigation, we compute $\mathrm{Isom}\left(\mathcal{W}_p(\mathbb{R})\right)$, the isometry group of the Wasserstein space $\mathcal{W}_p(\mathbb{R})$ for all $p \in [1, \infty)\setminus\{2\}$. We show that $\mathcal{W}_2(\mathbb{R})$ is also exceptional regarding the parameter $p$: $\mathcal{W}_p(\mathbb{R})$ is isometrically rigid if and only if $p\neq 2$. Regarding the underlying space, we prove that the exceptionality of $p=2$ disappears if we replace $\mathbb{R}$ by the compact interval $[0,1]$. Surprisingly, in that case, $\mathcal{W}_p\left([0,1]\right)$ is isometrically rigid if and only if $p\neq1$. Moreover, $\mathcal{W}_1\left([0,1]\right)$ admits isometries that split mass, and $\mathrm{Isom}\left(\mathcal{W}_1\left([0,1]\right)\right)$ cannot be embedded into $\mathrm{Isom}\left(\mathcal{W}_1(\mathbb{R})\right).$, Comment: 32 pages, 7 figures. Accepted for publication in Trans. Amer. Math. Soc

We calculate the entanglement entropy of a non-contiguous subsystem of a chain of free fermions. The starting point is a formula suggested by Jin and Korepin, \texttt{arXiv:1104.1004}, for the reduced density of states of two disjoint intervals with lattice sites $P=\{1,2,\dots,m\}\cup\{2m+1,2m+2,\dots, 3m\}$, which applies to this model. As a first step in the asymptotic analysis of this system, we consider its simplification to two disjoint intervals separated just by one site, and we rigorously calculate the mutual information between these two blocks and the rest of the chain. In order to compute the entropy we need to study the asymptotic behaviour of an inverse Toeplitz matrix with Fisher-Hartwig symbol using the the Riemann--Hilbert method., Comment: 25 pages, 6 figures, title changed

The aim of this short paper is to offer a complete characterization of all (not necessarily surjective) isometric embeddings of the Wasserstein space $\mathcal{W}_p(\mathcal{X})$, where $\mathcal{X}$ is a countable discrete metric space and $0

Botelho, Jamison, and Moln\'ar \cite{BJM}, and Geh\' er and \v{S}emrl \cite{GeS} have recently described the general form of surjective isometries of Grassmann spaces of all projections of a fixed finite rank on a Hilbert space $H$. As a straightforward consequence one can characterize surjective isometries of Grassmann spaces of projections of a fixed finite corank. In this paper we solve the remaining structural problem for surjective isometries on the set $P_\infty (H)$ of all projections of infinite rank and infinite corank when $H$ is separable. The proof technique is entirely different from the previous ones and is based on the study of geodesics in the Grassmannian $P_\infty (H)$. However, the same method gives an alternative proof in the case of finite rank projections., Comment: accepted for publication, Advances in Mathematics (2018)

Wigner's celebrated theorem, which is particularly important in the mathematical foundations of quantum mechanics, states that every bijective transformation on the set of all rank-one projections of a complex Hilbert space which preserves the transition probability is induced by a unitary or an antiunitary operator. This vital theorem has been generalised in various ways by several scientists. In 2001, Moln\'ar provided a natural generalisation, namely, he provided a characterisation of (not necessarily bijective) maps which act on the Grassmann space of all rank-$n$ projections and leave the system of Jordan principal angles invariant (see [20] and [17]). In this paper we give a very natural joint generalisation of Wigner's and Moln\'ar's theorems, namely, we prove a characterisation of all (not necessarily bijective) transformations on the Grassmann space which fix the quantity $\mathrm{tr} PQ$ (i.e.~the sum of the squares of cosines of principal angles) for every pair of rank-$n$ projections $P$ and $Q$.

According to the fundamental work of Yu.V. Prokhorov, the general theory of stochastic processes can be regarded as the theory of probability measures in complete separable metric spaces. Since stochastic processes depending upon a continuous parameter are basically probability measures on certain subspaces of the space of all functions of a real variable, a particularly important case of this theory is when the underlying metric space has a linear structure. Prokhorov also provided a concrete metrisation of the topology of weak convergence today known as the L{\'e}vy-Prokhorov distance. Motivated by these facts, the famous Banach-Stone theorem, and some recent works related to characterisations of onto isometries of spaces of Borel probability measures, here we give a complete description of surjective isometries with respect to the L{\'e}vy-Prokhorov metric in case when the underlying metric space is a separable Banach space. Our result can be considered as a generalisation of L. Moln\'ar's earlier Banach-Stone-type result which characterises onto isometries of the space of all probability distribution functions on the real line wit respect to the L\'evy distance. However, the present more general setting requires the development of an essentially new technique., Comment: Accepted for publication in Annali della Scuola normale superiore di Pisa - Classe di scienze

We describe the structure of all bijective maps on the cone of positive definite operators acting on a finite and at least two-dimensional complex Hilbert space which preserve the quantum $\chi_\alpha^2$-divergence for some $\alpha \in [0,1]$. We prove that any such transformation is necessarily implemented by either a unitary or an antiunitary operator. Similar results concerning maps on the cone of positive semidefinite operators as well as on the set of all density operators are also derived.

Characterizations of surjective isometries with respect to the Kuiper distance on three classes of Borel probability measures of $\mathbb{R}$ (or equivalently, probability distribution functions) are presented here. These classes are the set of continuous, absolute continuous and general measures., Comment: 15 pages, to appear, Houston Journal of Mathematics, 2017

Let $H$ be either a complex inner product space of dimension at least two, or a real inner product space of dimension at least three. Let us fix an $\alpha\in \left(0,\tfrac{\pi}{2}\right)$. The purpose of this paper is to characterize all bijective transformations on the projective space $P(H)$ obtained from $H$ which preserves the angle $\alpha$ between lines in both directions. (We emphasize that we do not assume anything about other angles). For real inner product spaces and when $H=\mathbb{C}^2$ we do this for every $\alpha$, and when $H$ is a complex inner product space of dimension at least three we describe the structure of these transformations for $\alpha\leq\tfrac{\pi}{4}$. As an application, we give an Uhlhorn-type generalization of a famous theorem of Wigner which is considered to be a cornerstone of the mathematical foundations of quantum mechanics. Namely, we show that under the above assumptions, every bijective map on the set of pure states of a quantum mechanical system that preserves the transition probability $\cos^2\alpha$ in both directions is a Wigner symmetry (i.e. it automatically preserves all transition probability), except for the case when $H=\mathbb{C}^2$ and $\alpha = \tfrac{\pi}{4}$ where an additional possibility occurs. We note that the classical theorem of Uhlhorn is the solution for the $\alpha = \tfrac{\pi}{2}$ case. Usually in the literature, results which are connected to Wigner's theorem are discussed under the assumption of completeness of $H$, however, here we shall remove this unnecessary hypothesis. Our main tools are a characterization of bijective maps on unit spheres of real inner product spaces which preserve an angle in both directions, and an extension of Uhlhorn's theorem for non-complete inner product spaces., Comment: 29 pages

It is an elementary fact that if we fix an arbitrary set of $d+1$ affine independent points $\{p_0,\dots p_d\}$ in $\mathbb{R}^d$, then the Euclidean distances $\{|x-p_j|\}_{j=0}^d$ determine the point $x$ in $\mathbb{R}^d$ uniquely. In this paper we investigate a similar problem in general normed spaces which is motivated by this known fact. Namely, we characterize those, at least $d$-dimensional, real normed spaces $(X, \|\cdot\|)$ such that for every set of $d+1$ affine independent points $\{p_0,\dots p_d\} \subset X$, the distances $\{\|x-p_j\|\}_{j=0}^d$ determines the point $x$ lying in the simplex $\mathrm{Conv}(p_0,\dots p_d)$ uniquely. Surprisingly, the characterization depends on $d$., Comment: 14 pages, 3 figures The first Arxiv version had a different title!

The goal of this paper is to point out that the results obtained in the recent papers [7,8,10,11] can be seriously strengthened in the sense that we can significantly relax the assumptions of the main results so that we still get the same conclusions. In order to do this first, we prove that for $n \geq 3$ any transformation which preserves the $n$-norm of any $n$ vectors is automatically plus-minus linear. This will give a re-proof of the well-known Mazur--Ulam-type result that every $n$-isometry is automatically affine ($n \geq 2$) which was proven in several papers, e.g. in [9]. Second, following the work of Rassias and \v{S}emrl [23], we provide the solution of a natural Aleksandrov-type problem in $n$-normed spaces, namely, we show that every surjective transformation which preserves the unit $n$-distance in both directions ($n\geq 2$) is automatically an $n$-isometry.

Botelho, Jamison, and Moln\' ar have recently described the general form of surjective isometries of Grassmann spaces on complex Hilbert spaces under certain dimensionality assumptions. In this paper we provide a new approach to this problem which enables us first, to give a shorter proof and second, to remove dimensionality constraints completely. In one of the low dimensional cases, which was not covered by Botelho, Jamison, and Moln\' ar, an exceptional possibility occurs. As a byproduct, we are able to handle the real case as well. Furthermore, in finite dimensions we remove the surectivity assumption. A variety of tools is used in order to achieve our goal, such as topological, geometrical and linear algebra techniques. The famous two projections theorem for two finite rank projections will be re-proven using linear algebraic methods. A theorem of Gy\"ory and the second author on orthogonality preservers on Grassmann spaces will be strengthened as well. This latter result will be obtained by using Chow's fundamental theorem of geometry of Grassmannians., Comment: 17 pages

We prove that an injective, not necessarily bounded weighted bilateral shift operator on $\ell^2(\mathbb{Z})$ is similar to a normal operator if and only if it is similar to a scalar multiple of the simple (i.e. unweighted) bilateral shift operator $S$., Comment: 6 pages, Keywords: Bilateral weighted shift operator, similarity to normal operators

This dissertation summarizes my investigations in operator theory during my PhD studies. The first chapter is an introduction to that field of operator theory which was developed by B. Sz.-Nagy and C. Foias, the theory of power-bounded Hilbert space operators. In the second and third chapter I characterize operators which arise from power-bounded operators asymptotically. Chapter 4 is devoted to provide a possible generalization of (the necessity part of) Sz.-Nagy's famous similarity theorem. In Chapter 5 I collected my results concerning the commutant mapping of asymptotically non-vanishing contractions. In the final chapter the reader can find results about cyclic properties of weighted shift operators on directed trees., Comment: 96 pages, 6 chapters, 3 figures. Page 87-89 was written in Hungarian, but it is the same as page 84-86. phd thesis, University of Szeged

Let $E$ be a two-dimensional real normed space. In this paper we show that if the unit circle of $E$ does not contain any line segment such that the distance between its endpoints is greater than 1, then every transformation $\phi\colon E\to E$ which preserves the unit distance is automatically an affine isometry. In particular, this condition is satisfied when the norm is strictly convex., Comment: 8 pages, 3 figures

In this paper first we describe all (not necessarily linear or bijective) transformations on $\mathbb{R}^d$ with $2\leq d<\infty$ which preserve the area of parallelograms spanned by any two vectors. We also characterize those (not necessarily linear) bijections on an arbitrary real Hilbert space that preserve the latter quantity. This answers a question raised by Rassias and Wagner, and it can be considered as a variant of the famous Wigner theorem on real Hilbert spaces which plays an important role in quantum mechanics. As a consequence, we solve a preserver problem of Moln\'ar and Timmermann which has remained open stubbornly only in the two-dimensional case. Finally this two-dimensional result will be applied in order to strengthen their theorem in higher dimensions., Comment: 14 pages

In this paper we characterize those positive operators which are asymptotic limits of contractions in strong operator topology or uniform topology. We examine the problem when the asymptotic limits of two contractions coincide., Comment: 12 pages

The main goal of this paper is to characterise all the possible Ces\`aro and $L$-asymptotic limits of powerbounded, complex matrices. The investigation of the $L$-asymptotic limit of a powerbounded operator goes back to Sz.-Nagy and it shows how the orbit of a vector behaves with respect to the powers. It turns out that the two types of asymptotic limits coincide for every powerbounded matrix and a special case is connected to the description of the products $SS^*$ where $S$ runs through those invertible matrices which have unit columnvectors. We also show that for any powerbounded operator acting on an arbitrary complex Hilbert space the norm of the $L$-asymptotic limit is greater than or equal to 1, unless it is zero; moreover, the same is true for the Ces\`aro asymptotic limit of a not necessarily powerbounded operator, if it exists., Comment: 15 pages, Linear and Multilinear Algebra(2014)

In this paper first we give a partial answer to a question of L. Moln\'ar and W. Timmermann. Namely, we will describe those linear (not necessarily bijective) transformations on the set of self-adjoint matrices which preserve a unitarily invariant norm of the commutator. After that we will characterize those (not necessarily linear or bijective) maps on the set of self-adjoint rank-one projections acting on a two-dimensional complex Hilbert space which leave the latter quantity invariant. Finally, this result will be applied in order to obtain a description of such bijective preservers on the unitary group and on the set of density operators., Comment: 16 pages, submitted to a journal

The non-bijective version of Wigner's theorem states that a map which is defined on the set of self-adjoint, rank-one projections (or pure states) of a complex Hilbert space and which preserves the transition probability between any two elements, is induced by a linear or antilinear isometry. We present a completely new, elementary and very short proof of this famous theorem which is very important in quantum mechanics. We do not assume bijectivity of the mapping or separability of the underlying space like in many other proofs., Comment: 4 pages

Sz.-Nagy's famous theorem states that a bounded operator $T$ which acts on a complex Hilbert space $\mathcal{H}$ is similar to a unitary operator if and only if $T$ is invertible and both $T$ and $T^{-1}$ are power bounded. There is an equivalent reformulation of that result which considers the self-adjoint iterates of $T$ and uses a Banach limit $L$. In this paper first we present a generalization of the necessity part in Sz.-Nagy's result concerning operators that are similar to normal operators. In the second part we provide characterization of all possible strong operator topology limits of the self-adjoint iterates of those contractions which are similar to unitary operators and act on a separable infinite-dimensional Hilbert space. This strengthens Sz.-Nagy's theorem for contractions., Comment: 13 pages, accepted for publication in Proceedings of the AMS

In this paper we investigate a new class of operators called weighted shifts on directed trees introduced recently in [Z. J. Jablonski, I. B. Jung and J. Stochel, A Non-hyponormal Operator Generating Stieltjes Moment Sequences, J. Funct. Anal. 262 (2012), no. 9, 3946--3980.]. This class is a natural generalization of the so called weighted bilateral, unilateral and backward shift operators. In the first part of the paper we calculate the asymptotic limit and the isometric asymptote of a contractive weighted shift on a directed tree and that of the adjoint. Then we use the asymptotic behaviour and similarity properties to deal with cyclicity. We also show that a weighted backward shift operator is cyclic if and only if there is at most one zero weight., Comment: 22 pages