相关论文: Remarks on Bounds for Quantum Codes

Quantum computing comes with the potential to push computational boundaries in various domains including, e.g., cryptography, simulation, optimization, and machine learning. Exploiting the principles of quantum mechanics, new algorithms can…

We present two recent works on the thermodynamic limit of quantum Coulomb systems, in which we provided a general method allowing to show the existence of the limit for many different models.

An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…

We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…

A quantum scalar field theory with spacetime-dependent coupling is studied. Surprisingly, while translation invariance is explicitly broken in the classical theory, momentum conservation is recovered at the quantum level for some specific…

We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…

It has been recently claimed that no protocol for measuring quantum work can satisfy standard required physical principles, casting doubts on the compatibility between quantum mechanics, thermodynamics, and the classical limit. In this…

We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…

We briefly discuss the current state, and future computational implications, of quantum type theory.

We consider a non-relativistic particle in a one-dimensional box with all possible quantum boundary conditions that make the kinetic-energy operator selfadjoint. We determine the Wigner functions of the corresponding eigenfunctions and…

We define a large class of quantum sources and prove a quantum analog of the asymptotic equipartition property. Our proof relies on using local measurements on the quantum source to obtain an associated classical source. The classical…

This article presents a review of quantum computing research works for Natural Language Processing (NLP). Their goal is to improve the performance of current models, and to provide a better representation of several linguistic phenomena,…

Constrained Hamiltonian description of the classical limit is utilized in order to derive consistent dynamical equations for hybrid quantum-classical systems. Starting with a compound quantum system in the Hamiltonian formulation conditions…

We demonstrate that, in certain cases, quantization and the classical limit provide functors that are "almost inverse" to each other. These functors map between categories of algebraic structures for classical and quantum physics,…

We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard…

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

Quantum computers are believed to bring computational advantages in simulating quantum many body systems. However, recent works have shown that classical machine learning algorithms are able to predict numerous properties of quantum systems…

We have constructed a quantum field theory in a finite box, with periodic boundary conditions, using the hypothesis that particles living in a finite box are created and/or annihilated by the creation and/or annihilation operators,…

This article deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum…

We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…