The quasi-analog formulation of duality computers is provided, inspired from the actual path integral understanding of the double-slit experiment and the inadequacies of the standard formulation of duality computers in explaining the experiment. In (analog) quantum mechanics, position and momentum are not typically discrete variables, but it is feasible to take the qubit (digital) approximation by selecting a set of approximately orthogonal states as computational basis for the qubits, such as Gaussian states with sufficient distances. The qubit approximation as an effective representation cannot be used for addressing the question of whether the computational system evolves unitarily without violating linearity, and fine-grained dynamics can respect linearity when effective dynamics do not. A general limiting procedure for determining qubit states regardless of effective unitarity violation is provided. The new formulation resolves the zero wavefunction paradox naturally out of the box and provides a method for detecting the unnormalized zero wavefunction. The resulting formulation of duality computers does not require additional postselection or non-unitary operators over unitary quantum mechanics and has realistic potentials to provide additional computational advantage over ordinary quantum computers.
The quasi-analog formulation of duality computers is provided, inspired from the actual path integral understanding of the double-slit experiment and the inadequacies of the standard formulation of duality computers in explaining the experiment. In (analog) quantum mechanics, position and momentum are not typically discrete variables, but it is feasible to take the qubit (digital) approximation by selecting a set of approximately orthogonal states as computational basis for the qubits, such as Gaussian states with sufficient distances. The qubit approximation as an effective representation cannot be used for addressing the question of whether the computational system evolves unitarily without violating linearity, and fine-grained dynamics can respect linearity when effective dynamics do not. A general limiting procedure for determining qubit states regardless of effective unitarity violation is provided. The new formulation resolves the zero wavefunction paradox naturally out of the box and provides a method for detecting the unnormalized zero wavefunction. The resulting formulation of duality computers does not require additional postselection or non-unitary operators over unitary quantum mechanics and has realistic potentials to provide additional computational advantage over ordinary quantum computers.
Analog quantum algorithms are formulated in terms of Hamiltonians rather than unitary gates and include quantum adiabatic computing, quantum annealing, and the Quantum Approximate Optimization Algorithm (QAOA).These algorithms are promising candidates for near-term quantum applications, but they often require fine tuning via the annealing schedule or variational parameters.In this work we connect all these algorithms to the optimal analog procedure.Notably, we explore how the optimal procedure approaches a smooth adiabatic procedure but with a superposed oscillatory pattern that can be explained in terms of the interactions between the ground state and first excited state.Furthermore, we provide numeric and analytic evidence that QAOA emulates this optimal procedure with the length of each QAOA layer equal to the period of the oscillatory pattern.Furthermore, the ratios of the QAOA bangs is determined by the smooth, non-oscillatory part of the optimal procedure.We provide arguments for these phenomena in terms of the product formula expansion of the optimal procedure.All of this shows that these analog algorithms are all different limits and approximations of the same optimal quantum protocol.In the appendix, we present a new algorithm for better approximating the optimal protocol using the insights from the main body.
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.
One of the yet unsolved, simplest yet fundamental problems in physics is the question of the speed ofgravitational action. Suppose that the Sun disappeared suddenly. The question is: will gravitational pull of the Sun on Earth disappear instantaneously or with a delay of the speed of light? Based onastronomical observations, some experts have argued that the direction of gravitational pull of the Sun on Earth now is directed towards the position of the Sun now, implying instantaneous transmission. Moreover, they have argued that finite speed of gravity would result in instability of planetary systems. However, another line of reasoning by this author has also shown that this literal view of instantaneous transmission is also wrong. This paradox leads us to a profound conclusion that the speed of gravity has dual nature: light speed and instantaneous. How can this be? The new finding is that causality will be (apparently or actually) violated in gravitational phenomenon as follows. Suppose that the Sun disappeared at time t = 0. The strange thing is that the Sun will anticipate its disappearance and will emit zero gravitational field toward the Earth 8.3 minutes before its actual disappearance! This signal travels at the speed of light and reach the Earth after 8.3 minutes. This means that the signal of zero gravitational field will reach the Earth at time t = 0. The arrival of zero gravitational field at the Earth will coincide exactly in time with the disappearance of the Sun, implying instantaneous transmission. Actually, the discovery of this idea of causality violation did not emerge from investigation of the gravitational phenomenon discussed above. It emerged from a line of reasoning during investigation of quantum phenomena, such as particle interference patterns in double-slit experiments, quantum entanglement, “which way” and quantum erasure experiments. From a new insight about the internal structure and dynamics of quantum particles such as photons and electrons, a conclusion has been reached that the exact point on the detector screen of a double-slit experiment where a photon will land is completely predetermined by fine tuning the initial conditions of the photon and the electron during emission. This means that where exactly a photon lands on the detecting screen is completely predetermined by its initial conditions, just as where exactly a ball lands on the ground is predetermined by its initial conditions. This means that in principle an interference pattern or any arbitrary pattern could be formed on the detector screen by (almost) infinitely fine-tuning the initial conditions of the photon during emission, regardless of whether one or both slits are open, regardless of the distance between the slits, regardless of the distance of the detecting screen. The conclusion is that aiming a photon to a particular atom on the screen requires (almost) infinite fine-tuning during emission. This raises the burning question: WHO fine-tunes the photons during emission so that they form an interference pattern or a Gaussian pattern? The emitting atom? The light source conspiring with the detecting screen? Atoms have infinitely small intelligence as to do the infinitely complex task of fine-tuning a photon. The conclusion is that a super natural being is fine-tuning and, literally, aiming each and every photon emitted not only from the light source of a double slit experiment, but also all photons emitted from all light sources in the universe. The overwhelming evidence of divine intervention is that photons and electrons cannot by themselves behave both as waves and as particles simultaneously. LITERALLY, God has been behind all confusing light speed experiments and observations made over centuries. It has been discovered that the correct model of the speed of light is a novel, seamless fusion of ether theory and emission theory ( Apparent Source Theory ). Photons cannot by themselves exhibit this dual nature. Literally, all dualities observed so far in light, electromagnetism and gravity are possible ONLY by DIRECT divine intervention.
Here we review the general quantum interference principle and the duality quantum computer which was proposed recently.The general quantum interference principle is the concretization of Dirac's statement about single photon interference and the generalization into multi-photon quantum systems.It applies not only to compact quantum system such as an atom,but also to loose quantum system such as a few independent photons.Using the general quantum interference principle,many debated issues can be explained,for instance the interference in a quantum system of two independent photons.From the view point of general quantum interference principle,two photon or multi-photon interferences,are just the interference of the two photon system with the two photon system itself,the interference of multi-photon system with itself.The general quantum interference principle can be expressed in terms of a general Feynman path-integral of a multi-constituents system and be calculated quantitatively.Based on this principle,we proposed a new type of computer,the duality computer or duality quantum computer.In principle,the duality computer is superior to classical computer and the quantum computer in the sense that it can do more than them.In a duality computer,the wave function of the computer is split into many parts,and each part is processed independently through a series of quantum gates,and then the different parts are recombined to get the final results.In addition to quantum parallelism,there is also duality parallelism in which different gate operations can be performed on different parts of the wave function simultaneously in a duality computer.The mathematical theory of duality computer has been established,and this has paved the way for further research.Studies have shown that a n bits duality computer with d-slits can be simulated by a quantum computer with n+log2d qubits.This relationship makes duality computing in an ordinary quantum computer possible,and also spares the seemingly insurmountable obstacle of building a moving quantum computer which a duality computer at all is.The duality computing in an ordinary quantum computer is called duality computing mode of a quantum computer.This relationship also helps us in understanding the general quantum interference principle.Because the underlying physics of an ordinary quantum computer is just quantum mechanics,the general quantum interference principle is also compatible with the usual quantum mechanics.However this principle exhibits itself only in a multipartite quantum system,thus it is difficult to understand it in simple single particle quantum systems.Duality computer is a new type of computer,and there are many unresolved issues and opportunity as well.In a duality computer,the gate operations need not be unitary and could be any operation that we may think of.The type of gates allowed in duality computing is called duality gate or generalized quantum gate.Generalized quantum gates have attracted the attention of mathematicians and some mathematical results have been obtained on the properties of the generalized quantum gates.Besides the mathematical properties of duality computing,duality computing may offer a bridge between quantum computing and classical computing so that classical algorithms may be transformed into quantum algorithms.Because the nonunitarity of generalized quantum gates,it may play important role in the study of open quantum systems.
Context. Nature is the relation among processes and phenomena. Nothing exists in the universe without relations. Computer is transactions of relations between data with the help of control and execution mechanisms. Quantum relations are a superposition of particles and their states. Superposition and entanglement are equivalent concepts. Entanglement is a non-local superposition of deterministic states. A quantum computer is unconditional transactions of relations between qubit data. Quantum computer is an analog device for parallel solution of combinatorial problems. Practically oriented definitions of the quantum computer concepts are the path to development of scalable quantum parallel algorithms for combinatorial problems solving. Any algorithm can be reduced to a sequence of operations without conditions, because any truth table is a collection of a complete system of conditions-states. Any sequence of actions can always be reduced to one parallel operation. Conditions and sequences arise only when the developer wants to use previously created primitive constructs to build an always non-optimal computing unit. The paradigm of quantum computer creation is determined through the use of photonic transactions on the electrons of an atom may exclude the use of quantum logic. The evolutionary path of a quantum computer from the classical one: “memory-address-transaction” (MAT) → “electron-addresstransaction” → “electron-address-quantaction” (EAQ) → state-superposition-logic. The meeting point of classical and quantum computers is photon transactions on the structure of electrons. Everything that is calculated on a quantum computer can be calculated in parallel on a classical one on account of memory redundancy. The given example is a memory-driven algorithm for modeling digital products based on qubit-vector forms of functionality description for significant performance boost of computing processes by parallel execution of logical operations. Objective. Simulation of the correct SoC-component behavior based on vector representation of the logic. Formation of the triggering development of a computing based on the superposition of the classical, quantum and analog computing process, which in its development should be based on technological qubit, tabular and vector data structures for the parallel solution of combinatorial problems. Method. MAT-computing implements any algorithms on account of transactions (read-write) in memory. Qubit-vector models for describing functionalities, which differ from known truth tables in compactness of description and manufacturability for the implementation of parallel algorithms of the synthesis and analysis of digital devices and SoC-components. Results. 1) The metric of the technological data structures, focused on parallel troubleshooting in digital systems based on the usage of two logical vector operations, was proposed for the first time. 2) The metric of relations between the individual components of QC, allowing organizing a quantum deterministic computer, has been further developed. 3) Quantum architectural solutions, that allow solving coverage problems in a quasi-parallel mode, were proposed for the first time. 4) Architectural solutions based on an analog-to-digital computing, which can be used to solve the problems of the digital systems parallel analysis, have been further developed. 5) Vector-qubit structures of the logic data, that allow a quasi-parallel simulation of digital circuits, were proposed. Conclusions. Qubit models, quantum methods and combinatorial algorithms for technical diagnostics of digital devices have been implemented, which can significantly (up to 25%) reduce the time of test synthesis, deductive modeling of faulty and correct behavior, search for defective states by introducing an innovative idea of using qubit-vector data structures for describing logical components. Comparative assessments of qubit models and methods usage show an increase in the efficiency of algorithms for modeling digital devices compared to tabular ones. The superposition of a classical, quantum and analog computer is integrally represented, which allows to find the best solutions for recognition and decision making.
Quantum simulation and computing traditionally has been based on two main paradigms, namely, digital and analog. In the digital paradigm, usually single and two-qubit gates (where qubit is an acronym for quantum bit) are employed as building blocks for scalable, universal quantum computing, although errors add up fast and error correction will be ultimately needed for scaling up. In the analog paradigm, large analog blocks are normally employed for a unitary dynamics that carries out the computation, enabling quantum operations on many qubits with reduced errors, but with the drawback of a limited choice of evolutions and lack of universality. In the past decade, a new paradigm has emerged, showing interesting possibilities for quantum simulation and computing in the near and mid term. This is the paradigm of digital-analog quantum technologies, which proposes to combine the best of both paradigms: large analog blocks, provided by native interactions of the employed quantum platform, enabling scalability, combined with digital gates, allowing for more versatility and, ultimately, universality. In this Perspective, I give an overview of the evolution of the field along the past decade, and an outlook for its future possibilities.