相关论文: Testing integrability with a single bit of quantum…
We study a simple one-dimensional quantum system on a circle with n scale free point interactions. The spectrum of this system is discrete and expressible as a solution of an explicit secular equation. However, its statistical properties…
Quantum error correction (QEC) is one of the central concepts in quantum information science and also has wide applications in fundamental physics. The capacity theorems provide solid foundations of QEC. We here provide a general and highly…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
We briefly review the most relevant aspects of complete integrability for classical systems and identify those aspects which should be present in a definition of quantum integrability. We show that a naive extension of classical concepts to…
The accessible information quantifies the amount of classical information that can be extracted from an ensemble of quantum states. Analogously, the informational power quantifies the amount of classical information that can be extracted by…
This document describes a family of quantum circuits which load classical data into a quantum state. When loading $N$ classical bits, the result quantum state is of order $\log_2(N)$ qubits. Furthermore the gate depth of the data loading…
This study explores the effects of introducing a symmetry breaking disorder on the dynamics of a system invariant under particle permutation. The disorder forces quantum states, confined to the $N+1$ dimensional completely symmetric space…
Entanglement is a Hilbert-space based measure of nonseparability of states that leads to unique quantum possibilities such as teleportation. It has been at the center of intense activity in the area of quantum information theory and…
We show that the quantum linear harmonic oscillator can be obtained in the large $N$ limit of a classical deterministic system with SU(1,1) dynamical symmetry. This is done in analogy with recent work by G.'t Hooft who investigated a…
We discuss the roles of the macroscopic limit and of different system-environment interactions in the quantum-classical transition for a chaotic system. We consider the kicked harmonic oscillator subject to reservoirs that correspond in the…
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
In the quantum computation verification problem, a quantum server wants to convince a client that the output of evaluating a quantum circuit $C$ is some result that it claims. This problem is considered very important both theoretically and…
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
We investigate a quantum algorithm which simulates efficiently the quantum kicked rotator model, a system which displays rich physical properties, and enables to study problems of quantum chaos, atomic physics and localization of electrons…
Quantum integrability of classical integrable systems given by quadratic Killing tensors on curved configuration spaces is investigated. It is proven that, using a "minimal" quantization scheme, quantum integrability is insured for a large…
Quantum kicked top is a fundamental model for time-dependent, chaotic Hamiltonian system and has been realized in experiments as well. As the quantum kicked top can be represented as a system of qubits, it is also popular as a testbed for…
Quantum computers are on the brink of surpassing the capabilities of even the most powerful classical computers. This naturally raises the question of how one can trust the results of a quantum computer when they cannot be compared to…
One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been…
We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints…