Quantum error-correcting codes from algebraic curves
... code which attains the Singleton bound. Rains [28, Theorem 2] showed that all quantum MDS codes are pure. There is an interesting relationship betweeen quantum MDS codes and classical MDS codes. If Q is a quantum MDS stabilizer code with n − 2d + 2 > 0, then it gives rise to classical MDS codes [22, ...
... code which attains the Singleton bound. Rains [28, Theorem 2] showed that all quantum MDS codes are pure. There is an interesting relationship betweeen quantum MDS codes and classical MDS codes. If Q is a quantum MDS stabilizer code with n − 2d + 2 > 0, then it gives rise to classical MDS codes [22, ...
Quantum Computation and Quantum Information
... Abstract. Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation and cryptography. As the theory of quantum physics i ...
... Abstract. Quantum computation and quantum information are of great current interest in computer science, mathematics, physical sciences and engineering. They will likely lead to a new wave of technological innovations in communication, computation and cryptography. As the theory of quantum physics i ...
Quantum Channels - Institut Camille Jordan
... to characterize them, to find useful representations of them. In particular we would like to find a representation of L which makes use only of ingredients coming from H,in the same way as for the density matrices whose strong point is that they are a given ingredient of H from which one can compute ...
... to characterize them, to find useful representations of them. In particular we would like to find a representation of L which makes use only of ingredients coming from H,in the same way as for the density matrices whose strong point is that they are a given ingredient of H from which one can compute ...
Calculating Floquet states of large quantum systems: A
... atoms, quantum optics and nanoscale fabrication techniques has brought quantum physics in touch with technology [1, 2, 3]. It is then natural that computational quantum physics plays an ever increasing role in explaining and guiding current experiments and suggesting new ones [4]. From the computati ...
... atoms, quantum optics and nanoscale fabrication techniques has brought quantum physics in touch with technology [1, 2, 3]. It is then natural that computational quantum physics plays an ever increasing role in explaining and guiding current experiments and suggesting new ones [4]. From the computati ...
Whole-Parts Strategies in Quantum Chemistry: Some Philosophical
... chemists actually do in their laboratories. Our approach does not consist in applying types of mereology – that is to say types of logic of propositional reasoning concerning relations between wholes and parts – or prior concepts of emergence to chemical activities but, in contrast, in identifying t ...
... chemists actually do in their laboratories. Our approach does not consist in applying types of mereology – that is to say types of logic of propositional reasoning concerning relations between wholes and parts – or prior concepts of emergence to chemical activities but, in contrast, in identifying t ...
Quantum noise properties of multiphoton transitions in driven nonlinear resonators
... also nanomechanical devices which have been successfully realized in the deep quantum regime only recently [9–11]. In addition, quantum transport devices on the basis of molecular junctions have been realized where the interplay of charge transport and vibrational properties of the molecular bridge ...
... also nanomechanical devices which have been successfully realized in the deep quantum regime only recently [9–11]. In addition, quantum transport devices on the basis of molecular junctions have been realized where the interplay of charge transport and vibrational properties of the molecular bridge ...
Preparing Ground States of Quantum Many
... Imitates an initially hot metal (random state) that is slowly cooled down. If cooling is too fast, the system can become trapped in a local minimum. Running time depends on the energy landscape. In the worst case, the running time is proportional to the number of states N = 2n . ...
... Imitates an initially hot metal (random state) that is slowly cooled down. If cooling is too fast, the system can become trapped in a local minimum. Running time depends on the energy landscape. In the worst case, the running time is proportional to the number of states N = 2n . ...
Dynamics of the quantum Duffing oscillator in the driving induced q
... Classical non-linear systems subjected to strong periodic external driving often have several stable stationary states for which the amplitudes and phases of the forced vibrations differ in size [1–3]. One of the simplest theoretical models which show the coexistence of two stable states induced by e ...
... Classical non-linear systems subjected to strong periodic external driving often have several stable stationary states for which the amplitudes and phases of the forced vibrations differ in size [1–3]. One of the simplest theoretical models which show the coexistence of two stable states induced by e ...
Spin-based quantum computers made by chemistry: hows and whys†
... state of a Turing machine at any time can be understood in binary code as a string of 1s and 0s (or a sequence of on/off states, or up/down, or heads/tails, etc.). Even though real computers may not be constructed like a Turing machine (indeed Turing machines provide a very clumsy model for a realis ...
... state of a Turing machine at any time can be understood in binary code as a string of 1s and 0s (or a sequence of on/off states, or up/down, or heads/tails, etc.). Even though real computers may not be constructed like a Turing machine (indeed Turing machines provide a very clumsy model for a realis ...
Quantum computing
Quantum computing studies theoretical computation systems (quantum computers) that make direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits (qubits), which can be in superpositions of states. A quantum Turing machine is a theoretical model of such a computer, and is also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers. The field of quantum computing was initiated by the work of Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985. A quantum computer with spins as quantum bits was also formulated for use as a quantum space–time in 1968.As of 2015, the development of actual quantum computers is still in its infancy, but experiments have been carried out in which quantum computational operations were executed on a very small number of quantum bits. Both practical and theoretical research continues, and many national governments and military agencies are funding quantum computing research in an effort to develop quantum computers for civilian, business, trade, and national security purposes, such as cryptanalysis.Large-scale quantum computers will be able to solve certain problems much more quickly than any classical computers that use even the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.Given sufficient computational resources, however, a classical computer could be made to simulate any quantum algorithm, as quantum computation does not violate the Church–Turing thesis.