Related papers: Quantum integrability of quadratic Killing tensors
To guarantee the normal functioning of quantum devices in different scenarios, appropriate benchmarking tool kits are quite significant. Inspired by the recent progress on quantum state verification, here we establish a general framework of…
Though it was proven that secure quantum sealing of a single classical bit is impossible in principle, here we propose an unconditionally secure quantum sealing protocol which seals a classical bit string. Any reader can obtain each bit of…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
We propose and construct a quantum money scheme that allows verification through classical communication with a bank. This is the first demonstration that a secure quantum money scheme exists that does not require quantum communication for…
Quantum annealing is an optimization technique which potentially leverages quantum tunneling to enhance computational performance. Existing quantum annealers use superconducting flux qubits with short coherence times, limited primarily by…
The spectral curve is the key ingredient in the modern theory of classical integrable systems. We develop a construction of the ``quantum spectral curve'' and argue that it takes the analogous structural and unifying role on the quantum…
In this paper, I will discuss the geometrical structures of multipartite quantum systems based on complex projective schemes. In particular, I will explicitly construct multi-qubit states in terms of these schemes and also discuss…
Kernel methods are used extensively in classical machine learning, especially in the field of pattern analysis. In this paper, we propose a kernel-based quantum machine learning algorithm that can be implemented on a near-term, intermediate…
Quantum computing hardware has grown sufficiently complex that it often can no longer be simulated by classical computers, but its computational power remains limited by errors. These errors corrupt the results of quantum algorithms, and it…
Quantum computing has become a promising computing approach because of its capability to solve certain problems, exponentially faster than classical computers. A $n$-qubit quantum system is capable of providing $2^{n}$ computational space…
Recursive techniques have recently been introduced into quantum programming so that a variety of large quantum circuits and algorithms can be elegantly and economically programmed. In this paper, we present a proof system for formal…
The purpose of this paper is to show how a class of classical linear stochastic systems can be physically implemented using quantum optical components. Quantum optical systems typically have much higher bandwidth than electronic devices,…
Many of the challenges of scaling quantum computer hardware lie at the interface between the qubits and the classical control signals used to manipulate them. Modular ion trap quantum computer architectures address scalability by…
A general mathematical framework for quantum key distribution based on the concepts of quantum channel and Turing machine is suggested. The security for its special case is proved. The assumption is that the adversary can perform only…
Quantum bit seal is a way to encode a classical bit quantum mechanically so that everyone can obtain non-zero information on the value of the bit. Moreover, such an attempt should have a high chance of being detected by an authorized…
It is shown with the help of skew-symmetric forms that the mathematical physics equations, on which no additional conditions are imposed, have quantum properties. And this is due to the integrability properties of differential equations,…
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify the quantum advantage of an untrusted prover. That is, a quantum prover can correctly answer the verifier's challenges and…
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…
In this paper, the physical realizability property is investigated for a class of nonlinear quantum systems. This property determines whether a given set of nonlinear quantum stochastic differential equations corresponds to a physical…
Quantum entanglement plays an important role in quantum computation and communication. It is necessary for many protocols and computations, but causes unexpected disturbance of computational states. Hence, static analysis of quantum…