Programmable architecture for quantum computing Jialin Chen, Lingli Wang, Edoardo Charbon,
... part is an array of static, long-lived quantum memories that can interact with moving, short-lived quantum registers—flying qubits—via a fixed interaction [28]. We call this part “quantum routing channels” (QRCs), which are used as quantum routing resources and to realize diagonal unitary operators. ...
... part is an array of static, long-lived quantum memories that can interact with moving, short-lived quantum registers—flying qubits—via a fixed interaction [28]. We call this part “quantum routing channels” (QRCs), which are used as quantum routing resources and to realize diagonal unitary operators. ...
An exponential separation between quantum and classical one
... Unfortunately not yet... for every group G people have considered so far (e.g. abelian groups), there is in fact a more clever O(log |G|) bit classical protocol! The complexity of the general problem has been an open problem for some time [Aaronson et al ’09]... now it’s even considered to be a “sem ...
... Unfortunately not yet... for every group G people have considered so far (e.g. abelian groups), there is in fact a more clever O(log |G|) bit classical protocol! The complexity of the general problem has been an open problem for some time [Aaronson et al ’09]... now it’s even considered to be a “sem ...
Assessing the Nonequilibrium Thermodynamics in a
... We analyze in detail the full statistics of the work distribution in a quantum many-body system. We report explicit expressions for all the moments and cumulants of the work distribution in the case of a sudden quench of a Hamiltonian parameter. In particular, we analyze the case of a system subject ...
... We analyze in detail the full statistics of the work distribution in a quantum many-body system. We report explicit expressions for all the moments and cumulants of the work distribution in the case of a sudden quench of a Hamiltonian parameter. In particular, we analyze the case of a system subject ...
q -entropies and the entanglement dynamics of two-qubits interacting with an... 408 A. Hamadou-Ibrahim et al.
... for the Tsallis and the Rényi entropies. The results are shown in Figure 1 and Figure 2, where the time evolutions of the concurrence C and of the Dq quantities are shown for the Tsallis and the Rényi entropies, respectively. In these figures the entropic differences Dq are plotted against the non ...
... for the Tsallis and the Rényi entropies. The results are shown in Figure 1 and Figure 2, where the time evolutions of the concurrence C and of the Dq quantities are shown for the Tsallis and the Rényi entropies, respectively. In these figures the entropic differences Dq are plotted against the non ...
Source
... This document presents a Data Model to describe Spectral Line Transitions in the context of the Simple Line Access Protocol defined by the IVOA (c.f. Ref[] IVOA Simple Line Access protocol) The main objective of the model is to integrate with and support the Simple Line Access Protocol, with which ...
... This document presents a Data Model to describe Spectral Line Transitions in the context of the Simple Line Access Protocol defined by the IVOA (c.f. Ref[] IVOA Simple Line Access protocol) The main objective of the model is to integrate with and support the Simple Line Access Protocol, with which ...
Nonclassical States of Cold Atomic Ensembles and of Light Fields
... shown in Fig. 2 as well as for the six fiducial input states, H, V, L, R, S, and T are evaluated from the measured density matrices. Fig. 2 shows that F is close to unity with no notable dependence on the zenith angle θ, and we have verified separately that the same is true for the azimuth angle ϕ. ...
... shown in Fig. 2 as well as for the six fiducial input states, H, V, L, R, S, and T are evaluated from the measured density matrices. Fig. 2 shows that F is close to unity with no notable dependence on the zenith angle θ, and we have verified separately that the same is true for the azimuth angle ϕ. ...
Photon quantum mechanics and beam splitters
... zero, corresponding to variations from constructive to destructive interference. Such variations correspond to the appearance and disappearance of interference fringes as in a Michelson interferometer; therefore, in what follows we will use the word ‘‘fringes’’ to refer to these variations in count ...
... zero, corresponding to variations from constructive to destructive interference. Such variations correspond to the appearance and disappearance of interference fringes as in a Michelson interferometer; therefore, in what follows we will use the word ‘‘fringes’’ to refer to these variations in count ...
Quantum Error Correction
... Let us examine more closely the error syndrome for the classical repetition code. A correctly-encoded state 000 or 111 has the property that the first two bits have even parity (an even number of 1’s), and similarly for the 2nd and 3rd bits. A state with an error on one of the first two bits has odd ...
... Let us examine more closely the error syndrome for the classical repetition code. A correctly-encoded state 000 or 111 has the property that the first two bits have even parity (an even number of 1’s), and similarly for the 2nd and 3rd bits. A state with an error on one of the first two bits has odd ...
On a measurement-free quantum lambda calculus with classical
... quantum circuit families (remember that the two formalisms have been showed to be equivalent (Nishimura and Ozawa 2008))? In tackling the expressive power problem, we prove the equivalence between our calculus and quantum circuit families. As far as we are aware, this is the first time that such a st ...
... quantum circuit families (remember that the two formalisms have been showed to be equivalent (Nishimura and Ozawa 2008))? In tackling the expressive power problem, we prove the equivalence between our calculus and quantum circuit families. As far as we are aware, this is the first time that such a st ...
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.