Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the analysis, and a simulation gives a "film" which visualizes many particle quantum dynamics and is demonstrated to a user of the model. Restrictions following from the algorithm theory are considered on a level of fundamental physical laws. Born rule for the calculation of quantum probability as well as the decoherence is derived from the existence of a nonzero minimal value of amplitude module - a grain of amplitude. The limitation on the classical computational resources gives the unified description of quantum dynamics that is not divided to the unitary dynamics and measurements and does not depend on the existence of observer. It is proposed the description of states based on the nesting of particles in each other that permits to account the effects of all levels in the same model. Algorithmic approach admits the possibility of refutation, because it forbids the creation of a scalable quantum computer that is allowed in the conventional quantum formalism.
An algorithmic approach to theoretical quantum physics is described postulating that any multiparticle quantum evolution can be simulated by classical algorithms of polynomial complexity. Its implementation is presented that is based on the concept of an amplitude quantum, i.e., the smallest carrier of amplitude. As a consequence, the Born rule for quantum probability is derived within the classical urn scheme. Decoherence is treated as stemming from the inherently limited amount of computational resources available for multiparticle simulation. The algorithmic approach denies the possibility of creating a scalable quantum computer. It is therefore refutable by construction of such a computer.
The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imaginary time dynamics. In this work, we first review the conventional variational principles, including the Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel variational principle, the McLachlan's variational principle, and the time-dependent variational principle, for simulating real time dynamics. We focus on the simulation of dynamics and discuss the connections of the three variational principles. Previous works mainly focus on the unitary evolution of pure states. In this work, we introduce variational quantum simulation of mixed states under general stochastic evolution. We show how the results can be reduced to the pure state case with a correction term that takes accounts of global phase alignment. For variational simulation of imaginary time evolution, we also extend it to the mixed state scenario and discuss variational Gibbs state preparation. We further elaborate on the design of ansatz that is compatible with post-selection measurement and the implementation of the generalised variational algorithms with quantum circuits. Our work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware.
Quantum simulation, which is generically the task to employ quantum computers to simulate quantum physical models, has been one of the most significant motivations of quantum computing. Quantum dynamics, unitary or nonunitary Markovian dynamics driven by local interactions, has been proved to be efficiently simulatable on quantum computers. Extending the underlying models from unitary to nonunitary evolution, and from continuous-time to discrete-time evolution is essential not only for quantum simulation of more general processes, e.g., dissipative processes with evident non-Markovian effects, but also for developing alternative quantum computing models and algorithms. In this thesis, we explore quantum simulation problems mainly from the following three themes. First, we extend quantum simulation framework of Hamiltonian-driven evolution to quantum simulation of quantum channels, combined with the scheme of algorithmic simulation that accepts a promised simulation accuracy, hence algorithmic quantum channel simulation. Our simulation scheme contains a classical preprocessing part, i.e. a classical algorithm for quantum-circuit design, and a quantum part that is the execution of a quantum circuit for the quantum channel simulator. Second, we employ simulation algorithms for arbitrary quantum channels beyond the dilation method. We explore channel decomposition in terms of convex combination of smaller channels, known as generalized extreme channels, which is known as a nontrivial open problem. To attack this problem, we develop an optimization algorithm for approximate decomposition into a convex sum of generalized extreme channels. We provide an ansatz that proves to be able to yield arbitrary generalized extreme channels and allows a precise quantum circuit description. Furthermore, our numerical simulation has demonstrated the validity of our optimization algorithm for low-dimensional quantum channels. Third, by considering quantum simulation problems beyond the rough distinction between digital and analog simulations, and beyond the quantum-state generation problem, we define uniform, strong, and weak quantum simulations from the point view of operator topology. Besides strong simulation of quantum channels, we define a general weak quantum simulation problem, which simulates observable effects instead of the effects on state generation. Also we study the channel simulation problem in the quantum query model, and provide the query complexity by employing uniform quantum simulation method.
Abstract (1) Deutsch stated: it is shown that quantum theory and the ‘universal quantum computer’ are compatible with the principle, that is, it is shown the compatibility of quantum computing with quantum mechanics. Born Rule and Time Evolution Postulate are the important ingredients of quantum theory. Deutsch et al. did not provide a proof of the compatibility of quantum computing with Born Rule (and Time Evolution Postulate), avoided the extraction of unitary transformation results in their papers, and defaulted that the output probability density can map to the observation-space CS C and to be read. We attribute the proof of the incompatibility of quantum computing with quantum mechanics to the proof of the incompatibility of quantum computing with Born Rule. The basic form of Born Rule is that
∣ψ∣2 represents the probability density for particles; if the system is in a state
∣ψ⟩, then the probability that the eigenvalue λ i of Q is found when Q is measured is P(λ i ) =
∣⟨λn∣ψ⟩∣2. We show that in the technical scheme of quantum computing, there is an imposed strong constraint on Born Rule, that is, double
∣ψ∣2 hypothesis (i.e., Feynman-Deutsch’s
∣ψ∣2(double) reading hypothesis), which requires that there is such a mapping from the state-space CS M to the observation-space CS C :
∣ψM∣2→
∣ψC∣2, where
∣ψM∣2is the probability density of the wavefunction
a∣0⟩+b∣1⟩ of the single-qubit,
∣ψC∣2 is the probability density of the corresponding outcomes within CS C , and
∣ψC∣2 is equivalent to
∣ψM∣2. The original Born Rule does not assert the mapping
∣ψM∣2→
∣ψC∣2. We demonstrate that in the technical scheme of quantum computing it is assumed that the single-qubit carrier-symbol snapshot traceability is the basis for the realization of the double
∣ψ∣2. We, using the Stern-Gerlach experiment and the chip engineer's contraction mapping experiment, experimentally falsify the single-qubit carrier-symbol snapshot traceability, and thus experimentally falsify the Feynman-Deutsch’s
∣ψ∣2(double) reading hypothesis. In this way, we show that quantum computing is incompatible with Born Rule and the related measurement postulates, and the Feynman-Deutsch quantum computing theory is not feasible. The principal error of the Feynman-Deutsch theory is the mapping
∣ψM∣2→
∣ψC∣2; the root of all errors in quantum computing is the double probability density hidden in the technical scheme, which is the false Born Rule. (2) The Feynman-Deutsch theory is a low-strict, low-testable and non-transparent theory for the following reasons: postulate-level assumptions are hidden in the technical scheme; the testability (falsifiability) of various parts of quantum computing has never been publicized. It has long been believed that quantum computing centers on unitary transformation sequence. We show that qubit reading is the only falsifiable part of quantum computing. Because falsifiable issue takes precedence over unfalsifiable issue, and principle-level issue takes precedence over non-principle-level issue, the priority of quantum computing research is the inapplicability of Born Rule to quantum computing rather than the applicability of unitary transformation. i.e., the real heart of quantum computing is the existence of
∣ψ∣2 mapping from CS M to CS C . We prove the fact that although algorithm and the algorithm’s output within CS M are carried out in the name of quantum technology, the "double
∣ψ∣2" is actually independent of Born Rule, and independent of quantum mechanics. The methodological error of the Feynman-Deutsch theory is to exclude the inapplicability of Born Rule from the research field. (3) We re-examined the effectiveness of three published quantum computing (Shor factoring) experiments, and show that they are invalid in the sense of falsifiability criterion and the traversal criterion. The high risk of the infeasibility of quantum computing is completely underestimated. (4) In the last sections, we examine a topic with a higher degree of generality: the traceability (direction non-constraint) of single-particle information process. Using the “reproducible effect” method suggested by Popper, we show that the realization of quantum computing violates human's existing knowledge about the contraction mapping experiments of two spaces. The proofs in this paper show that the compression mapping experiment in meso-micro scale and the physical version of Gödel's incompleteness theorem are more profound principles of quantum physics (including Born Rule and the related measurement postulates).
In principle, a quantum computer may enable algorithmic methods that are theoretically more optimal than those that can be achieved using a conventional computer. The scalability of the number of mathematical operations required to perform specific quantum algorithms may perfectly balance the apparent quantum concurrency, such that the net result is comparable to classical parallelism. This chapter presents computer technology as a mathematical formulation devoid of any physical links. Only the usage of notation and language acquired from quantum physics may be considered moderation. Computing in the quantum realm is based on a probability paradigm. Computational activities approximating highly structured unitary matrix are important for the success of quantum algorithms because they may be expressed implicitly with low complexity. The chapter shows how certain modifications might pave the way for the creation of novel quantum cryptography that are more advanced than the best conventional counterparts.