Quantum Gates and Simon`s Algorithm
... Introduction to qubits, quantum gates, and circuits. Appetizer: Two-bit problem where quantum beats classical! The power of quantum computing: Simon’s algorithm Basic principles used: Computing in superposition Constructive/destructive interference ...
... Introduction to qubits, quantum gates, and circuits. Appetizer: Two-bit problem where quantum beats classical! The power of quantum computing: Simon’s algorithm Basic principles used: Computing in superposition Constructive/destructive interference ...
The Computational Complexity of Linear Optics
... cannot be done by a classical computer in probabilistic polynomial time, unless factoring integers can as well. As the above formulation makes clear, Shor’s result is not merely about some hypothetical future in which large-scale quantum computers are built. It is also a hardness result for a practi ...
... cannot be done by a classical computer in probabilistic polynomial time, unless factoring integers can as well. As the above formulation makes clear, Shor’s result is not merely about some hypothetical future in which large-scale quantum computers are built. It is also a hardness result for a practi ...
On the Reality of the Quantum State
... by German electric companies, who at the time were attempting to produce the brightest light bulbs possible given minimum energy input, an optimisation problem that would be solved by a correct blackbody theory. By the end of 1893 Wien had discovered [7] what is now known as Wien’s law, giving the b ...
... by German electric companies, who at the time were attempting to produce the brightest light bulbs possible given minimum energy input, an optimisation problem that would be solved by a correct blackbody theory. By the end of 1893 Wien had discovered [7] what is now known as Wien’s law, giving the b ...
Aspects of the Quantum Hall Effect
... They found, in addition to the integer plateaus, additional steps in the Hall resistance at fractional values of the filling factor, at ν = 13 , 51 and so on. The theoretical obstacle to explaining these features was stark and immediate: when ν < 1, there are more available degenerate electronic sta ...
... They found, in addition to the integer plateaus, additional steps in the Hall resistance at fractional values of the filling factor, at ν = 13 , 51 and so on. The theoretical obstacle to explaining these features was stark and immediate: when ν < 1, there are more available degenerate electronic sta ...
Fractional quantum Hall effect in suspended graphene probed with
... Coulomb forces between these carriers, the expected manifestations of collective behaviour (Apalkov & Chakraborty 2006; Peres et al. 2006; Toke et al. 2006; Yang et al. 2006; Goerbig & Regnault 2007; Khveshchenko 2007; Wang et al. 2008) have been conspicuously difficult to detect. Here, we discuss re ...
... Coulomb forces between these carriers, the expected manifestations of collective behaviour (Apalkov & Chakraborty 2006; Peres et al. 2006; Toke et al. 2006; Yang et al. 2006; Goerbig & Regnault 2007; Khveshchenko 2007; Wang et al. 2008) have been conspicuously difficult to detect. Here, we discuss re ...
Lower bounds for quantum communication complexity
... 1. Introduction. Quantum mechanical computing and communication has been studied extensively during the last decade. Communication has to be a physical process, so an investigation of the properties of physically allowed communication is desirable, and the fundamental theory of physics available to ...
... 1. Introduction. Quantum mechanical computing and communication has been studied extensively during the last decade. Communication has to be a physical process, so an investigation of the properties of physically allowed communication is desirable, and the fundamental theory of physics available to ...
A generalized entropy measuring quantum localization
... et al. [13] showed that the, so-called, cantori can also act as barriers like tori. A general (semiclassical) theory for this phenomenon is, however, still missing, at least to the knowledge of the authors. Besides these ``stronger types'' of localization, which are characterized by an exponential d ...
... et al. [13] showed that the, so-called, cantori can also act as barriers like tori. A general (semiclassical) theory for this phenomenon is, however, still missing, at least to the knowledge of the authors. Besides these ``stronger types'' of localization, which are characterized by an exponential d ...
Multi-particle qubits - Department of Physics — ETH Zurich
... We discuss several approaches for implementation of quantum computation over multiple spin-1/2 qubits. We divide the ways of encoding a qubit into three categories and introduce each category using case studies. For each qubit encoding scheme we search for possible physical operations that will impl ...
... We discuss several approaches for implementation of quantum computation over multiple spin-1/2 qubits. We divide the ways of encoding a qubit into three categories and introduce each category using case studies. For each qubit encoding scheme we search for possible physical operations that will impl ...
Is the quantum mechanical description of physical reality complete
... EPR argument as described by Einstein? Excerpts from Einstein’s letter to Popper “Should we regard the wave-function whose time dependent changes are, according to Schrödinger equation, deterministic, as a complete description of physical reality,…? The answer at which we arrive is the wave-functio ...
... EPR argument as described by Einstein? Excerpts from Einstein’s letter to Popper “Should we regard the wave-function whose time dependent changes are, according to Schrödinger equation, deterministic, as a complete description of physical reality,…? The answer at which we arrive is the wave-functio ...
Necessary and Sufficient Quantum Information Characterization of
... channel discrimination. In this sense, every entangled state, independently of how weakly entangled it is, is a resource. Nonetheless, exploiting such a resource may require arbitrary joint measurements on the output probe and ancilla [47]. From a conceptual perspective, one may want to limit measur ...
... channel discrimination. In this sense, every entangled state, independently of how weakly entangled it is, is a resource. Nonetheless, exploiting such a resource may require arbitrary joint measurements on the output probe and ancilla [47]. From a conceptual perspective, one may want to limit measur ...
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.