The Experts below are selected from a list of 2322 Experts worldwide ranked by ideXlab platform

D.c. Marinescu - One of the best experts on this subject based on the ideXlab platform.

I Brizita Djordjevic - One of the best experts on this subject based on the ideXlab platform.

  • Quantum Information Theory and Quantum Information Processing Fundamentals
    Physical-Layer Security and Quantum Key Distribution, 2019
    Co-Authors: I Brizita Djordjevic
    Abstract:

    In this chapter, we provide the basic concepts of Quantum information processing, Quantum information theory, and Quantum error correction. The following topics from Quantum information processing will be covered: state vectors, operators, density operators, measurements, dynamics of a Quantum system, superposition principle, Quantum Parallelism, no-cloning theorem, and entanglement. The following concepts from Quantum information theory will be provided: Holevo information, accessible information, Holevo bound, Shannon Entropy and von Neumann Entropy, Schumacher’s noiseless Quantum coding theorem, and Holevo–Schumacher–Westmoreland theorem. The basic concepts of Quantum error correction are introduced as well.

  • Quantum Information Theory Fundamentals
    Quantum Biological Information Theory, 2016
    Co-Authors: I Brizita Djordjevic
    Abstract:

    In this chapter, we provide the basic concepts of Quantum information processing and Quantum information theory. The following topics from Quantum information processing will be covered: state vectors, operators, density operators, measurements, dynamics of a Quantum system, superposition principle, Quantum Parallelism, no-cloning theorem, and entanglement. The following concepts from Quantum information theory will be provided: Holevo information, accessible information, Holevo bound, Shannon entropy and von Neumann entropy, Schumacher’s noiseless Quantum coding theorem, and Holevo–Schumacher–Westmoreland theorem.

  • Quantum Circuits and Quantum Information Processing Fundamentals
    Quantum Information Processing and Quantum Error Correction, 2012
    Co-Authors: I Brizita Djordjevic
    Abstract:

    In this chapter, basic single-qubit, two-qubits and many-qubits gates are described. The fundaments of Quantum information processing are provided as well. Various sets of universal Quantum gates are described too. Further, the Bloch sphere representation of single-qubit is provided, Gottesman–Knill theorem is formulated, the Bell state preparation circuit and the Quantum relay are described. The basics concepts of Quantum teleportation and Quantum computation are introduced. Further, the Quantum measurements circuits are provided and the principle of deferred measurement and the principle of implicit measurement are formulated. In addition to the topics mentioned above, the concepts of Quantum Parallelism and entanglement are introduced as well. Finally, the no-cloning theorem is provided and its consequences are discussed.

Dan C Marinescu - One of the best experts on this subject based on the ideXlab platform.

  • The Boole Lecture Quantum Information
    The Computer Journal, 2007
    Co-Authors: Dan C Marinescu, Gabriela M. Marinescu
    Abstract:

    Quantum and biological information processing could revolutionize computing and communication in the third millennium. In the 2007 Boole Lecture, we discussed the necessity to explore alternative paradigms for computing and communication and presented some striking features of Quantum information processing and provided some insights into Quantum Parallelism as well as Quantum communication and teleportation.

  • Quantum Information: A Glimpse At the Strange and Intriguing Future Of Information
    2007
    Co-Authors: Dan C Marinescu, Gabriela M. Marinescu
    Abstract:

    Quantum and biological information processing could revolutionize computing and communication in the third millennium. In the 2007 Boole Lecture, we discussed the necessity to explore alternative paradigms for computing and communication and presented some striking features of Quantum information processing and provided some insights into Quantum Parallelism as well as Quantum communication and teleportation.

  • Quantum Parallelism and the exact simulation of physical systems
    Computing Frontiers, 2004
    Co-Authors: Dan C Marinescu
    Abstract:

    Classical mechanics and physics limit our ability to compute faster and cheaper and suggests that we need to consider a revolutionary rather than an evolutionary approach to computing and communication. Quantum properties such as uncertainty, interference, and entanglement form the foundation of a new brand of theory where computational and communication processes rest upon fundamental physics.In early 1980s Richard Feynman argued that in traditional numerical simulations such as weather forecasting or aerodynamic calculations, computers model physical reality only approximately. He advanced the idea that physics was computational and that a computer could do an exact simulation of a physical system, even of a Quantum system. Starting from basic principles of thermodynamics and Quantum mechanics, Feynman suggested that problems for which polynomial time algorithms do not exist could be solved; computations for which polynomial algorithms exist could be speeded up considerably and even made reversible.In Quantum systems the amount of Parallelism increases exponentially with the size of the system; in other words, an exponential increase in Parallelism requires only a linear increase in the amount of space needed. The major difficulty lies in the fact that access to the results of a Quantum computation is restricted, access to the results disturbs the Quantum state.In this presentation we discuss basic concepts in Quantum computing and Quantum information theory and present some of our work on computational structural biology.

  • Conf. Computing Frontiers - Quantum Parallelism and the exact simulation of physical systems
    Proceedings of the first conference on computing frontiers on Computing frontiers - CF'04, 2004
    Co-Authors: Dan C Marinescu
    Abstract:

    Classical mechanics and physics limit our ability to compute faster and cheaper and suggests that we need to consider a revolutionary rather than an evolutionary approach to computing and communication. Quantum properties such as uncertainty, interference, and entanglement form the foundation of a new brand of theory where computational and communication processes rest upon fundamental physics.In early 1980s Richard Feynman argued that in traditional numerical simulations such as weather forecasting or aerodynamic calculations, computers model physical reality only approximately. He advanced the idea that physics was computational and that a computer could do an exact simulation of a physical system, even of a Quantum system. Starting from basic principles of thermodynamics and Quantum mechanics, Feynman suggested that problems for which polynomial time algorithms do not exist could be solved; computations for which polynomial algorithms exist could be speeded up considerably and even made reversible.In Quantum systems the amount of Parallelism increases exponentially with the size of the system; in other words, an exponential increase in Parallelism requires only a linear increase in the amount of space needed. The major difficulty lies in the fact that access to the results of a Quantum computation is restricted, access to the results disturbs the Quantum state.In this presentation we discuss basic concepts in Quantum computing and Quantum information theory and present some of our work on computational structural biology.

  • IPDPS - The promise of Quantum computing and Quantum information theory - Quantum Parallelism
    19th IEEE International Parallel and Distributed Processing Symposium, 1
    Co-Authors: Dan C Marinescu
    Abstract:

    We introduce basic concepts and some of the applications of Quantum computing and Quantum information theory. We discuss first the physical limitations of solid state technology, then we present a few experiments which reveal Quantum effects. We survey the basic principles of Quantum mechanics necessary to understand the behaviour of Quantum devices.

Stanley Martens - One of the best experts on this subject based on the ideXlab platform.

  • Schrodinger’s Register: Foundational Issues and Physical Realization
    viXra, 2017
    Co-Authors: Stephen Pink, Stanley Martens
    Abstract:

    This work-in-progress paper consists of four points which relate to the foundations and physical realization of Quantum computing. The first point is that the qubit cannot be taken as the basic unit for Quantum computing, because not every superposition of bit-strings of length n can be factored into a string of n-qubits. The second point is that the “No-cloning” theorem does not apply to the copying of one Quantum register into another register, because the mathematical representation of this copying is the identity operator, which is manifestly linear. The third point is that Quantum Parallelism is not destroyed only by environmental decoherence. There are two other forms of decoherence, which we call measurement decoherence and internal decoherence, that can also destroy Quantum Parallelism. The fourth point is that processing the contents of a Quantum register “one qubit at a time” destroys entanglement.

  • Schr¨ odinger's Register: Foundational Issues and Physical Realization
    2011
    Co-Authors: Stephen Pink, Stanley Martens
    Abstract:

    This work-in-progress paper consists of four points which relate to the foundations and physical realization of Quantum computing. The first point is that the qubit cannot be taken as the basic unit for Quantum computing, because not every superposition of bit-strings of length n can be factored into a string of n-qubits. The second point is that the “No-cloning” theorem does not apply to the copying of one Quantum register into another register, because the mathematical representation of this copying is the identity operator, which is manifestly linear. The third point is that Quantum Parallelism is not destroyed only by environmental decoherence. There are two other forms of decoherence, which we call measurement decoherence and internal decoherence, that can also destroy Quantum Parallelism. The fourth point is that processing the contents of a Quantum register “one qubit at a time” destroys entanglement. Keywords-qubit; entanglement; decoherence; no-cloning theorem; Quantum register.

Vladimir E. Korepin - One of the best experts on this subject based on the ideXlab platform.

  • A review on Quantum search algorithms
    Quantum Information Processing, 2017
    Co-Authors: Pulak Ranjan Giri, Vladimir E. Korepin
    Abstract:

    The use of superposition of states in Quantum computation, known as Quantum Parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented Quantum algorithms such as Deutsch’s algorithm, Deutsch–Jozsa algorithm and its variation as Bernstein–Vazirani algorithm, Simon algorithm, Shor’s algorithms, etc. Quantum Parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover’s Quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.