Related papers: The integer quantum Hall transition: an $S$-matrix…
We present a quantum-classical hybrid random power method that approximates a ground state of a Hamiltonian. The quantum part of our method computes a fixed number of elements of a Hamiltonian-matrix polynomial via quantum polynomial…
We propose an efficient method for Monte Carlo simulation of quantum lattice models. Unlike most other quantum Monte Carlo methods, a single run of the proposed method yields the free energy and the entropy with high precision for the whole…
The principle and the efficiency of the Monte Carlo transfer-matrix algorithm are discussed. Enhancements of this algorithm are illustrated by applications to several phase transitions in lattice spin models. We demonstrate how the…
Random matrix theory can be used to describe the transport properties of a chaotic quantum dot coupled to leads. In such a description, two approaches have been taken in the literature, considering either the Hamiltonian of the dot or its…
We introduce an efficient neural network (NN) architecture for classifying wave functions in terms of their localization. Our approach integrates a versatile quantum phase space parametrization leading to a custom 'quantum' NN, with the…
Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that…
We investigate systematically sample-to sample fluctuations of the probability $\tau$ of no return into a given entrance channel for wave scattering from disordered systems. For zero-dimensional ("quantum chaotic") and quasi one-dimensional…
Quasi-Monte Carlo (QMC) methods for estimating integrals are attractive since the resulting estimators typically converge at a faster rate than pseudo-random Monte Carlo. However, they can be difficult to set up on arbitrary posterior…
Learning representations of nodes in a low dimensional space is a crucial task with numerous interesting applications in network analysis, including link prediction, node classification, and visualization. Two popular approaches for this…
We study quantum state transfer through a qubit network modeled by spins with XY interaction, when relying on a single excitation. We show that it is possible to achieve perfect transfer by shifting (adding) energy to specific vertices.…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
This paper is the first of a series where we study quantum channels from the random matrix point of view. We develop a graphical tool that allows us to compute the expected moments of the output of a random quantum channel. As an…
We consider an ensemble of $2\times 2$ normal matrices with complex entries representing operators in the quantum mechanics of 2 - level parity-time reversal (PT) symmetric systems. The randomness of the ensemble is endowed by obtaining…
Entanglement, one of the clearest manifestations of non-classical physics, holds significant promise for technological applications such as more secure communications and faster computations. In this paper we explore the use of…
Localization problem of electronic states in a two-dimensional quantum spin Hall system (QSH - a symplectic model with a non-trivial topological structure) is studied by the transfer matrix method. The phase diagram in the plane of energy…
We derive and study SQMC (Sequential Quasi-Monte Carlo), a class of algorithms obtained by introducing QMC point sets in particle filtering. SQMC is related to, and may be seen as an extension of, the array-RQMC algorithm of L'Ecuyer et al.…
Measurements are a vital part of any quantum computation, whether as a final step to retrieve results, as an intermediate step to inform subsequent operations, or as part of the computation itself (as in measurement-based quantum…
This paper presents a comprehensive study on the scalability challenges and opportunities in quantum communication networks, with the goal of determining parameters that impact networks most as well as the trends that appear when scaling…
Teleportation of quantum gates is a critical step for implementation of quantum networking and teleportation-based models of quantum computation. We report an experimental demonstration of teleportation of the prototypical quantum…
We numerically investigate the spectral statistics of pseudo-energies for the unitary network operator U of the Chalker--Coddington network. The shape of the level spacing distribution as well the scaling of its moments is compared to known…