相关论文: Remarks on Bounds for Quantum Codes
t is well known that the difference between Quantum Mechanics and Classical Theory appears most crucially in the non Classical spin half of the former theory and the Wilson-Sommerfelt quantization rule. We argue that this is symptomatic of…
Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that…
We describe rules to simplify quantum circuits at their boundaries, i.e. at state preparation and measurement. There, any strictly incoherent operation may be pushed into a pre- or post-processing of classical data. The rules can greatly…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
I introduce rate-distortion theory for quantum coding, and derive a lower bound, involving the coherent information, on the rate at which qubits must be used to encode a quantum source with a given maximum level of distortion per source…
Three problems stand in the way of deriving classical theories from quantum mechanics: those of realist interpretation, of classical properties and of quantum measurement. Recently, we have identified some tacit assumptions that lie at the…
Machine Learning classification models learn the relation between input as features and output as a class in order to predict the class for the new given input. Quantum Mechanics (QM) has already shown its effectiveness in many fields and…
One of the fundamental theories of physics is that of quantum mechanics. Quantum mechanics tries to explain the inconsistencies in the behaviors of systems at the macro and micro scales. Quantum mechanics paved the way for quantum computing…
Quantum computers hold the promise to solve certain computational task much more efficiently than classical computers. We review the recent experimental advancements towards a quantum computer with trapped ions. In particular, various…
We construct a new family of quantum MDS codes from classical generalized Reed-Solomon codes and derive the necessary and sufficient condition under which these quantum codes exist. We also give code bounds and show how to construct them…
Quantum computers are becoming real, and they have the inherent potential to significantly impact many application domains. We sketch the basics about programming quantum computers, showing that quantum programs are typically hybrid…
Quantum variational algorithms have been one of major applications of quantum computing with current quantum devices. There are recent attempts to establish the foundation for these algorithms. A possible approach is to characterize the…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…
By leveraging quantum-mechanical properties like superposition, entanglement, and interference, quantum computing (QC) offers promising solutions for problems that classical computing has not been able to solve efficiently, such as drug…
A few conventions for thinking about and writing quantum pseudocode are proposed. The conventions can be used for presenting any quantum algorithm down to the lowest level and are consistent with a quantum random access machine (QRAM) model…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…
Additive codes and some nonadditive codes use the single and multiple invariant subspaces of the stabilizer G, respectively, to construct quantum codes, so the selection of the invariant subspaces is a key problem. In this paper, I provide…