Related papers: Computing exact moments of local random quantum ci…

In these lectures we describe the use of Monte Carlo simulations in understanding the role of tunneling events, instantons, in a quantum mechanical toy model. We study, in particular, a variety of methods that have been used in the QCD…

Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary $T$-designs for $n$-qudit…

We consider quantum circuits consisting of randomly chosen two-local gates and study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated, roughly meaning that the…

We introduce the concept of concatenated tensor networks to efficiently describe quantum states. We show that the corresponding concatenated tensor network states can efficiently describe time evolution and possess arbitrary block-wise…

To realize practical quantum computers, a large number of quantum bits (qubits) will be required. Semiconductor spin qubits offer advantages such as high scalability and compatibility with existing semiconductor technologies. However, as…

Instantaneous two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement, and the nonlocal interactions are limited to simultaneous classical communication in both…

We present an efficient tensor-network-based approach for simulating large-scale quantum circuits, demonstrated using Quantum Support Vector Machines (QSVMs). Our method effectively reduces exponential runtime growth to near-quadratic…

We introduce an algorithmic framework based on tensor networks for computing fluid flows around immersed objects in curvilinear coordinates. We show that the tensor network simulations can be carried out solely using highly compressed…

For oscillating time series, the prediction is often focused on the turning points. In order to predict the turning point magnitudes and times it is proposed to form the state space reconstruction only from the turning points and modify the…

Various algorithms have been developed to simulate quantum circuits on classical hardware. Among the most prominent are approaches based on \emph{stabilizer decompositions} and \emph{tensor network contraction}. In this work, we present a…

In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…

In this paper, we develop an explicit formula allowing to compute the first k moments of the random count of a pattern in a multi-states sequence generated by a Markov source. We derive efficient algorithms allowing to deal both with low or…

The study of tensor network theory is an important field and promises a wide range of experimental and quantum information theoretical applications. Matrix product state is the most well-known example of tensor network states, which…

We propose a direct numerical method to calculate the statistics of the number of transitions in stochastic processes, without having to resort to Monte Carlo calculations. The method is based on a generating function method, and arbitrary…

We propose to simulate quantum gates by \textit{LC} resonators, where the amplitude and the phase of the voltage describe the quantum state. By controlling capacitance or inductance of resonators, it is possible to control the phase of the…

With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, current quantum devices are only capable of short…

The computation of the diameter is one of the most central problems in distributed computation. In the standard CONGEST model, in which two adjacent nodes can exchange $O(\log n)$ bits per round (here $n$ denotes the number of nodes of the…

Quantum Monte Carlo calculations of electromagnetic moments and transitions are reported for A <= 9 nuclei. The realistic Argonne v18 two-nucleon and Illinois-7 three-nucleon potentials are used to generate the nuclear wave functions.…

We propose a tensor network encoding the set of all eigenstates of a fully many-body localized system in one dimension. Our construction, conceptually based on the ansatz introduced in Phys. Rev. B 94, 041116(R) (2016), is built from two…

It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…