98, 010506 (2007)
... [9–11], just such a system—an ‘‘artificially’’ created px ipy superfluid of spinless fermions—may now be within experimental reach. Exotic non-Abelian statistics is thus tantalizingly close to fruition in these systems. Since the atoms are in identical spin states, s-wave scattering is Pauli prohi ...
... [9–11], just such a system—an ‘‘artificially’’ created px ipy superfluid of spinless fermions—may now be within experimental reach. Exotic non-Abelian statistics is thus tantalizingly close to fruition in these systems. Since the atoms are in identical spin states, s-wave scattering is Pauli prohi ...
Prime Factorization by Quantum Adiabatic Computation
... improvements of Shor’s and Grover’s algorithms. In fact, quantum algorithms can roughly be divided into three groups: • Quantum algorithms based on the quantum Fourier transform. Both Deutsch’s and Shor’s algorithms are of this type. • Quantum search algorithms, similar to Grover’s algorithm. • Algo ...
... improvements of Shor’s and Grover’s algorithms. In fact, quantum algorithms can roughly be divided into three groups: • Quantum algorithms based on the quantum Fourier transform. Both Deutsch’s and Shor’s algorithms are of this type. • Quantum search algorithms, similar to Grover’s algorithm. • Algo ...
Floquet topological insulator in semiconductor
... versatile resource that can be used to achieve topological spectra in systems that are topologically trivial in equilibrium. In particular, we show that time-periodic perturbations may give rise to new differential operators with topological insulator spectra, dubbed Floquet topological insulators ( ...
... versatile resource that can be used to achieve topological spectra in systems that are topologically trivial in equilibrium. In particular, we show that time-periodic perturbations may give rise to new differential operators with topological insulator spectra, dubbed Floquet topological insulators ( ...
Quantum telescopes
... lost labor to build telescopes larger than about 1 m diameter. Today means exist to correct for the effects of atmospheric turbulence and thus a race has begun for ever larger telescopes. In its time the Great Forty Foot remained the largest telescope for over fifty years, nowadays a new telescope b ...
... lost labor to build telescopes larger than about 1 m diameter. Today means exist to correct for the effects of atmospheric turbulence and thus a race has begun for ever larger telescopes. In its time the Great Forty Foot remained the largest telescope for over fifty years, nowadays a new telescope b ...
Quantum Mechanical Modelling and Optical Spectroscopy of
... When dealing with particles on the atomic scale it is impossible to describe, with precision, events including position, momentum and energy. Therefore we speak instead of expectation values. The uncertainty ingrained in quantum theory describes the probabilistic nature of events involving these par ...
... When dealing with particles on the atomic scale it is impossible to describe, with precision, events including position, momentum and energy. Therefore we speak instead of expectation values. The uncertainty ingrained in quantum theory describes the probabilistic nature of events involving these par ...
Time-bin entangled qubits for quantum communication created by
... like quantum teleportation or entanglement swapping, and due to their ability to be transported in optical fibers, photons are the best candidates for long-distance applications 关1兴. Even though some of these protocols have already been experimentally realized 关2– 8兴, none of them was optimized for ...
... like quantum teleportation or entanglement swapping, and due to their ability to be transported in optical fibers, photons are the best candidates for long-distance applications 关1兴. Even though some of these protocols have already been experimentally realized 关2– 8兴, none of them was optimized for ...
Giesecke-Final-ternary-gates
... The choice of the best set of universal ternary gates for quantum circuits is an open problem. We create exact minimum cost ternary reversible gates with quantum multiplexers using the method of iterative deepening depth-first search (IDDFS) [25]. Such search is better for small problems than evolut ...
... The choice of the best set of universal ternary gates for quantum circuits is an open problem. We create exact minimum cost ternary reversible gates with quantum multiplexers using the method of iterative deepening depth-first search (IDDFS) [25]. Such search is better for small problems than evolut ...
UvA-DARE (Digital Academic Repository) The problem of
... which interest us here. Furthermore, there is a danger that distinctions found on the emic level may be subtly reproduced in etic discourse as well. For example, the reliance on terms such as ‘the new scientific worldview’, 5 which Hanegraaff connected to the notion of a disenchanted worldview, sugg ...
... which interest us here. Furthermore, there is a danger that distinctions found on the emic level may be subtly reproduced in etic discourse as well. For example, the reliance on terms such as ‘the new scientific worldview’, 5 which Hanegraaff connected to the notion of a disenchanted worldview, sugg ...
spin networks and the bracket polynomial
... [14] along with a comparison of the analogous situation for the q-deformed spin networks that we use in studying invariants of three-manifolds. It is not obvious how to fully generalise the chromatic method to the q-deformed spin nets. 4. Spin geometry and the geometry of spin networks. The bracket ...
... [14] along with a comparison of the analogous situation for the q-deformed spin networks that we use in studying invariants of three-manifolds. It is not obvious how to fully generalise the chromatic method to the q-deformed spin nets. 4. Spin geometry and the geometry of spin networks. The bracket ...
Effective Quantum Spin Systems with Trapped Ions
... the distance between ions is not constant. We can, however, define an averaged lattice constant d0 , to understand the qualitative properties of the vibrational modes. We have two cases, depending on the orientation of the pushing forces: (a) Axial force. The equilibrium position of the ions are suc ...
... the distance between ions is not constant. We can, however, define an averaged lattice constant d0 , to understand the qualitative properties of the vibrational modes. We have two cases, depending on the orientation of the pushing forces: (a) Axial force. The equilibrium position of the ions are suc ...
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.