Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userParallelism of quantum computations from prequantum classical statistical field theory (PCSFT)
111
0
0.0
(
0
)
Authors
Andrei Khrennikov
Ask ChatGPT about the research
No Arabic abstract
This paper is devoted to such a fundamental problem of quantum computing as quantum parallelism. It is well known that quantum parallelism is the basis of the ability of quantum computer to perform in polynomial time computations performed by classical computers for exponential time. Therefore better understanding of quantum parallelism is important both for theoretical and applied research, cf. e.g. David Deutsch cite{DD}. We present a realistic interpretation based on recently developed prequantum classical statistical field theory (PCSFT). In the PCSFT-approach to QM quantum states (mixed as well as pure) are labels of special ensembles of classical fields. Thus e.g. a single (!) ``electron in the pure state $psi$ can be identified with a special `` electron random field, say $Phi_psi(phi).$ Quantum computer operates with such random fields. By one computational step for e.g. a Boolean function $f(x_1,...,x_n)$ the initial random field $Phi_{psi_0}(phi)$ is transformed into the final random field $Phi_{psi_f}(phi)$ ``containing all values of $f.$ This is the objective of quantum computers ability to operate quickly with huge amounts of information -- in fact, with classical random fields.
rate research
Read More
In this paper, we extend the protocol of classical verification of quantum computations (CVQC) recently proposed by Mahadev to make the verification efficient. Our result is obtained in the following three steps: $bullet$ We show that parallel repetition of Mahadevs protocol has negligible soundness error. This gives the first constant round CVQC protocol with negligible soundness error. In this part, we only assume the quantum hardness of the learning with error (LWE) problem similar to the Mahadevs work. $bullet$ We construct a two-round CVQC protocol in the quantum random oracle model (QROM) where a cryptographic hash function is idealized to be a random function. This is obtained by applying the Fiat-Shamir transform to the parallel repetition version of the Mahadevs protocol. $bullet$ We construct a two-round CVQC protocol with the efficient verifier in the CRS+QRO model where both prover and verifier can access to a (classical) common reference string generated by a trusted third party in addition to quantum access to QRO. Specifically, the verifier can verify a $QTIME(T)$ computation in time $poly(n,log T)$ where $n$ is the security parameter. For proving soundness, we assume that a standard model instantiation of our two-round protocol with a concrete hash function (say, SHA-3) is sound and the existence of post-quantum indistinguishability obfuscation and post-quantum fully homomorphic encryption in addition to the quantum hardness of the LWE problem.
In this paper, we show how classical statistical field theory techniques can be used to efficiently perform the numerical evaluation of the non-perturbative Schwinger mechanism of particle production by quantum tunneling. In some approximation, we also consider the back-reaction of the produced particles on the external field, as well as the self-interactions of the produced particles.
We consider the problem of quantum-classical correspondence in integrable field theories. We propose a method to construct a field theoretical coherent state, in which the expectation value of the quantum field operator exactly coincides with the classical soliton. We also discuss the time evolution of this quantum state and the instability due to the nonlinearity.
This paper is concerned with the concept of {em information state} and its use in optimal feedback control of classical and quantum systems. The use of information states for measurement feedback problems is summarized. Generalization to fully quantum coherent feedback control problems is considered.
We consider the quantum-to-classical transition for macroscopic systems coupled to their environments. By applying Borns Rule, we are led to a particular set of quantum trajectories, or an unravelling, that describes the state of the system from the frame of reference of the subsystem. The unravelling involves a branch dependent Schmidt decomposition of the total state vector. The state in the subsystem frame, the conditioned state, is described by a Poisson process that involves a non-linear deterministic effective Schrodinger equation interspersed with quantum jumps into orthogonal states. We then consider a system whose classical analogue is a generic chaotic system. Although the state spreads out exponentially over phase space, the state in the frame of the subsystem localizes onto a narrow wave packet that follows the classical trajectory due to Ehrenfests Theorem. Quantum jumps occur with a rate that is the order of the effective Lyapunov exponent of the classical chaotic system and imply that the wave packet undergoes random kicks described by the classical Langevin equation of Brownian motion. The implication of the analysis is that this theory can explain in detail how classical mechanics arises from quantum mechanics by using only unitary evolution and Borns Rule applied to a subsystem.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
