Related papers: Universality of Entanglement and Quantum Computati…
The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to…
Researchers in physical science aim to uncover universal features in strongly interacting many-body systems, often hidden in complicated observables like entanglement entropy (EE). The non-local nature of EE makes it challenging to compute…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
Quantum computation provides exponential speedup for solving certain mathematical problems against classical computers. Motivated by current rapid experimental progress on quantum computing devices, various models of quantum computation…
We propose a unified scaling theory of entanglement entropy in the confinements of finite bond dimensions, dynamics and system sizes. Within the theory, the finite-entanglement scaling introduced recently is generalized to the dynamics…
We present a finite-size scaling analysis of the entanglement in a two-dimensional arrays of quantum dots modeled by the Hubbard Hamiltonian on a triangular lattice. Using multistage block renormalization group approach, we have found that…
Measurement-driven transitions between extensive and sub-extensive scaling of the entanglement entropy receive interest as they illuminate the intricate physics of thermalization and control in open interacting quantum systems. Whilst this…
Quantum entanglement is the cornerstone of quantum technology and enables quantum devices to outperform classical systems in terms of performance. However, detecting entanglement in high-dimensional systems remains a significant challenge…
We study dynamics of quantum entanglement in smooth global quenches with a finite rate, by computing the time evolution of entanglement entropy in 1 + 1 dimensional free scalar theory with time-dependent masses which start from a nonzero…
At continuous phase transitions, quantum many-body systems exhibit scale-invariance and complex, emergent universal behavior. Most strikingly, at a quantum critical point, correlations decay as a power law, with exponents determined by a…
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of N=15 in the case that the period $r=2$ and exploit a…
The goal of this paper is to outline a general-purpose scalable implementation of Shor's period finding algorithm using fundamental quantum gates, and to act as a blueprint for linear optical implementations of Shor's algorithm for both…
We investigate how to attack Shor's quantum algorithm for factorization with an entangling probe. We show that an attacker can steal an exact solution of Shor's algorithm outside an institute where the quantum computer is installed if he…
Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this…
Shor's factoring algorithm uses two quantum registers. By introducing more registers we show that the measured numbers in these registers which are of the same pre-measurement state, should be equal if the original Shor's complexity…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
We investigate the universality of correlation functions of chaotic and disordered quantum systems as an external parameter is varied. A new, general scaling procedure is introduced which makes the theory invariant under reparametrizations.…
We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network.…