Related papers: Quantum integrability of quadratic Killing tensors
We show that deterministic quantum computing with a single bit (DQC1) can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where $N$ is the dimension of the Hilbert space of…
Any architecture for practical quantum computing must be scalable. An attractive approach is to create multiple cores, computing regions of fixed size that are well-spaced but interlinked with communication channels. This exploded…
We study the concepts of compatibility and separability and their implications for quantum and classical systems. These concepts are illustrated on a macroscopic model for the singlet state of a quantum system of two entangled spin 1/2 with…
A new notion of integrability called the multi-dimensional consistency for the integrable systems with the Lagrangian 1-form structure is captured in the geometrical language for quantum level. A zero-curvature condition, which implies the…
It is demonstrated that the so-called "unavoidable quantum anomalies" can be avoided in the farmework of a special non-linear quantization scheme. A simple example is discussed in detail.
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
Many quantum integrable systems are obtained using an accelerator physics technique known as Ermakov (or normalized variables) transformation. This technique was used to create classical nonlinear integrable lattices for accelerators and…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
Quantum coherence allows for reduced-memory simulators of classical processes. Using recent results in single-shot quantum thermodynamics, we derive a minimal work cost rate for quantum simulators that is quasistatically attainable in the…
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
Quantum technology has led to increasingly sophisticated and complex quantum devices. Assessing their reliability (quantum reliability) is an important issue. Although reliability theory for classical devices has been well developed in…
We introduce three measures which quantify the degree to which quantum systems possess the robustness exhibited by classical systems when subjected to continuous observation. Using these we show that for a fixed environmental interaction…
In this paper we give examples of applications of general methods of quantization by symmetrization of classical integrable systems, which have been illustrated in two previous works by the same authors. We consider two classes of systems…
Authentication provides the trust people need to engage in transactions. The advent of physical keys that are impossible to copy promises to revolutionize this field. Up to now, such keys have been verified by classical challenge-response…
The ultimate goal of the classicality programme is to quantify the amount of quantumness of certain processes. Here, classicality is studied for a restricted type of process: quantum information processing (QIP). Under special conditions,…
We propose a quantum tomography scheme for pure qudit systems which adopts random base measurements and generative learning methods, along with a built-in fidelity estimation approach to assess the reliability of the tomographic states. We…
Quantum computing promises to enhance machine learning and artificial intelligence. Different quantum algorithms have been proposed to improve a wide spectrum of machine learning tasks. Yet, recent theoretical works show that, similar to…
A general and computable criterion for k-(in)separability in continuous multipartite quantum systems is presented. The criterion can be experimentally implemented with a finite and comparatively low number of local observables. We discuss…
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…
We study two-dimensional classically integrable field theory with independent boundary condition on each end, and obtain three possible generating functions for integrals of motion when this model is an ultralocal one. Classically…