Related papers: Remarks on Bounds for Quantum Codes
A quantum version of the action principle is formulated in terms of real parameters of a wave functional. The classical limit of the quantum action of a harmonic oscillator is obtained.
Classical physics fails where quantum physics prevails. This common understanding applies to quantum phenomena that are acknowledged to be beyond the reach of classical physics. Here, we make an attempt at weakening this solid belief that…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be…
An improved criterion for distinguishing conditions in which classical or quantum behavior occurs is developed by comparing classical and quantum mechanical measures of size while incorporating spatial and temporal restrictions on wave…
Quantum error correcting codes (QECC) is becoming an increasingly important branch of coding theory. For classical block codes, a \href{codetables.de} {comprehensive database of best known codes} exists which is available online at…
This paper is on identification of classical information by the use of quantum channels. We focus on simultaneous ID codes which use measurements being useful to identify an arbitrary message. We give a direct and a converse part of the…
Error-correction codes are central for fault-tolerant information processing. Here we develop a rigorous framework to describe various coding models based on quantum resource theory of superchannels. We find, by treating codings as…
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…
One of the best signatures of nonclassicality in a quantum system is the existence of correlations that have no classical counterpart. Different methods for quantifying the quantum and classical parts of correlations are amongst the more…
We investigate whether quantum theory can be understood as the continuum limit of a mechanical theory, in which there is a huge, but finite, number of classical 'worlds', and quantum effects arise solely from a universal interaction between…
Quantum computers and quantum algorithms have made great strides in the last few years and promise improvements over classical computing for specific tasks. Although the current hardware is not yet ready to make real impacts at the time of…
Decoupling theorems have proven useful in various applications in the area of quantum information theory. This thesis builds upon preceding work by Fr\'{e}d\'{e}ric Dupuis [arXiv:1012.6044v1], where a general decoupling theorem is obtained…
We extend the theory of the gauging of classical quadratically nonlinear algebras without a central charge but with a coset structure, to the quantum level. Inserting the minimal anomalies into the classical transformation rules of the…
Some quantal systems require only a small part of the full quantum theory for their analysis in classical terms. In such understanding we review some recent literature on semiclassical treatments. An analysis of it allows one to see that…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
One perspective on quantum algorithms is that they are classical algorithms having access to a special kind of memory with exotic properties. This perspective suggests that, even in the case of quantum algorithms, the control flow notions…
We review canonical experiments on systems that have pushed the boundary between the quantum and classical worlds towards much larger scales, and discuss their unique features that enable quantum coherence to survive. Because the types of…