Quantum dynamics with intermediate measurements in agreement with the classical dynamics
B. Kaulakys
备注：
5 pages, LaTex, no figures, to be published in Quantum Systems: New Trends and Methods, World Scientific, Proc. of the Intern. Workshop, Minsk, Belarus, June 3 - 7, 1996
The effect of repetitive measurement for quantum dynamics of driven by an intensive external force of the simple few-level systems as well as of the multilevel systems that exhibit the quantum localisation of classical chaos is investigated. Frequent measurement of the simple system yields to the quantum Zeno effect while that of the suppressed quantum system, which classical counterpart exhibits chaos, results in the delocalisation of the quantum suppression. From the analysis we may conclude that continuously observable quasiclassical system evolves essentially classically-like.
We introduce the notion of a leak for general process theories, and identify quantum theory as a theory with minimal leakage, while classical theory has maximal leakage. We provide a construction that adjoins leaks to theories, an instance of which describes the emergence of classical theory by adjoining decoherence-leaks to quantum theory. Finally, we show that defining a notion of purity for processes in general process theories has to make reference to the leaks of that theory ---a feature missing in standard definitions--- hence, we propose a refined definition and study the resulting noti…
We propose a realistic hybrid classical-quantum linear solver to solve systems of linear equations of a specific type, and demonstrate its feasibility using Qiskit on IBM Q systems. This algorithm makes use of quantum random walk that runs in $\mathcal{O}(N\log(N))$ time on a quantum circuit made of $\mathcal{O}(\log(N))$ qubits. The input and output are classical data, and so can be easily accessed. It is robust against noise, and ready for implementation in applications such as machine learning.
We present a collection of optimizers tuned for usage on Noisy Intermediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization (QAOA) algorithms. They are also used for calibration tasks, hyperparameter tuning, in machine learning, etc. We analyze the efficiency and effectiveness of different optimizers in a VQE case study. VQE is a hybrid algorithm, with a classical minimizer step driving the next evaluation on the quantum processor. While most results to date conc…
Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction/representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classica…
We introduce a distributed classical simulation algorithm for general quantum circuits, and present numerical results for calculating the output probabilities of universal random circuits. We find that we can simulate more qubits to greater depth than previously reported using the cluster supported by the Data Infrastructure and Search Technology Division of the Alibaba Group. For example, computing a single amplitude of an $8\times 8$ qubit circuit with depth $40$ was previously beyond the reach of supercomputers. Our algorithm can compute this within $2$ minutes using a small portion ($\appr…
When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low value, providing Alice and Bob with a secret key. In principle, quantum algorithms as well as classical algorithms can be used for this processing. A natural question is: up to which error rate on the raw key is a secret-key agreement at all possible? Under the assumption of incoherent eavesdropping, we find that the quantum and classical limits are precisely the…
The recent advent of noisy intermediate-scale quantum devices, especially near-term quantum computers, has sparked extensive research efforts concerned with their possible applications. At the forefront of the considered approaches are variational methods that use parametrized quantum circuits. The classical and quantum Fisher information are firmly rooted in the field of quantum sensing and have proven to be versatile tools to study such parametrized quantum systems. Their utility in the study of other applications of noisy intermediate-scale quantum devices, however, has only been discovered…
We theoretically investigate the strange phenomenon of attraction between the cavity mode and the exciton mode that has been experimentally observed in a photonic crystal cavity. Our results within the Lindblad master equation approach successfully explain why the apparent cavity-to-exciton spectral shifting occurs, and how this phenomenon is a manifestation of a dynamical phase transition in the system. Moreover, our findings are in good qualitative agreement with pioneer experimental results as well as support the hypothesis that an intermediate coupling regime exists in the cavity quantum e…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We prove for general states but under the assumption of incoherent eavesdropping that Alice and Bob share some so-called intrinsic information in their classical random variables, resulting from optimal measurements, …
Using a photonic quantum computer for boson sampling has been demonstrated a tremendous advantage over classical supercomputers. It is highly desirable to develop boson sampling algorithms for realistic scientific problems. In this work, we propose a hybrid quantum-classical sampling (HQCS) algorithm to calculate the optical spectrum for complex molecules considering anharmonicity and Duschinsky rotation (DR) effects. The classical sum-over-state method for this problem has a computational complexity that exponentially increases with system size. In the HQCS algorithm, an intermediate harmonic…
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian group $G$ is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In [arXiv:1201.4867] it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a nontrivial example of a family of quantum circuits that cannot yield exponential speed-ups in spite of usage of the QFT, the latter being a central quantum algorithmic primit…
We present a multi-level quantum-classical intermediate representation (IR) that enables an optimizing, retargetable, ahead-of-time compiler for available quantum programming languages. To demonstrate our architecture, we leverage our proposed IR to enable a compiler for version 3 of the OpenQASM quantum language specification. We support the entire gate-based OpenQASM 3 language and provide custom extensions for common quantum programming patterns and improved syntax. Our work builds upon the Multi-level Intermediate Representation (MLIR) framework and leverages its unique progressive lowerin…
Although Planck's constant h is currently regarded as the elementary quantum of action appearing in quantum theory, it can also be interpreted as the multiplicative scale factor setting the scale of classical zero-point radiation appearing in classical electromagnetic theory. Relativistic classical electron theory with classical electromagnetic zero-point radiation gives many results in agreement with quantum theory. The areas of agreement between this classical theory and Nature seem worth further investigation.
We study the concepts of compatibility and separability and their implications for quantum and classical systems. These concepts are illustrated on a macroscopic model for the singlet state of a quantum system of two entangled spin 1/2 with a parameter reflecting indeterminism in the measurement procedure. By varying this parameter we describe situations from quantum, intermediate to classical and study which tests are compatible or separated. We prove that for classical deterministic systems the concepts of separability and compatibility coincide, but for quantum systems and intermediate syst…
We investigate quantum secret sharing schemes constructed from $[[n,k,δ]]_D$ non-binary stabilizer quantum error correcting codes with carrier qudits of prime dimension $D$. We provide a systematic way of determining the access structure, which completely determines the forbidden and intermediate structures. We then show that the information available to the intermediate structure can be fully described and quantified by what we call the *information group*, a subgroup of the Pauli group of $k$ qudits, and employ this group structure to construct a method for hiding the information from the in…
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a smaller transmission rate. Here, we examine this procedure when the intermediate variable is a quantum state. We determine when and how well quantum simulations of classical channels may improve upon the minimal rates of classical simulation. This inverts Holevo's original question of quantifying the capacity of quantum channels with classical resources. We …
We give a quantum logspace algorithm for powering contraction matrices, that is, matrices with spectral norm at most~1. The algorithm gets as an input an arbitrary $n\times n$ contraction matrix $A$, and a parameter $T \leq \mathrm{poly}(n)$ and outputs the entries of $A^T$, up to (arbitrary) polynomially small additive error. The algorithm applies only unitary operators, without intermediate measurements. We show various implications and applications of this result: First, we use this algorithm to show that the class of quantum logspace algorithms with only quantum memory and with intermediat…
It is pointed out that two separated quantum channels and three classical authenticated channels are sufficient resources to achieve detectable broadcast.
Semi-quantum protocols construct connections between quantum users and ``classical'' users who can only perform certain ``classical'' operations. In this paper, we present a new semi-quantum private comparison protocol based on entangled states and single particles, which does not require pre-shared keys between the ``classical'' users to guarantee the security of their private data. By utilizing multi-particle entangled states and single particles, our protocol can be easily extended to multi-party scenarios to meet the requirements of multiple ``classical'' users who want to compare their pr…
Non-additivity is one of the distinctive traits of Quantum Information Theory: the combined use of quantum objects may be more advantageous than the sum of their individual uses. Non-additivity effects have been proven, for example, for quantum channel capacities, entanglement distillation or state estimation. In this work, we consider whether non-additivity effects can be found in Classical Information Theory. We work in the secret-key agreement scenario in which two honest parties, having access to correlated classical data that are also correlated to an eavesdropper, aim at distilling a sec…
Motivated by quantum gravity, semi-classical theory, and quantum theory on curved spacetimes, we study the system of an oscillator coupled to two spin-1/2 particles. This model provides a prototype for comparing three types of dynamics: the full quantum theory, the classical oscillator with spin backreaction, and spins propagating on a fixed oscillator background. From nonperturbative calculations of oscillator and entanglement entropy dynamics, we find that entangled tripartite states produce novel oscillator trajectories, and that the three systems give equivalent dynamics for sufficiently w…
Gao applied LeRoy and Bernstein semi-classical analysis for the energy levels in a potential of the form -C/r^n to sequences of scaled energy differences progressing towards low lying states and found a better agreement with the semi-classical prediction. We checked that for the energy levels obtained by Stwalley et al. with the same potential, the agreement with the semi-classical approximation is better for higher vibrational quantum numbers in agreement with Bohr's correspondence principle.
Recently, a mutual semi-quantum key agreement protocol using Bell states is proposed by Yan et al. (Mod. Phys. Lett. A, 34, 1950294, 2019). The proposed protocol tries to help a quantum participant share a key with a classical participant who just has limited quantum capacities. Yan et al. claimed that both the participants have the same influence on the final shared key. However, this study points out that the classical participant can manipulate the final shared key by himself/herself without being detected. To solve this problem, an improved method is proposed here.
First quantum computers very recently have demonstrated "quantum supremacy" or "quantum advantage": Executing a computation that would have been impossible on a classical machine. Today's quantum computers follow the NISQ paradigm: They exhibit error rates that are much higher than in conventional electronics and have insufficient quantum resources to support powerful error correction protocols. This raises questions which relevant computations are within the reach of NISQ architectures. Several "NISQ-era algorithms" are assumed to match the specifics of such computers; for instance, variation…
Trade-offs between Quantum and Classical Resources in the Linear Combination of Unitaries
Graduate School of Science and Technology, Keio University（庆应义塾大学理工学研究科）；NTT Computer and Data Science Laboratories, NTT Inc.（日本电信电话株式会社计算机与数据科学实验室）；Department of Applied Physics and Physico-Informatics, Keio University（庆应义塾大学应用物理与理化信息学系）；NTT Research Center for Theoretical Quantum Information, NTT Inc.（日本电信电话株式会社理论量子信息中心）
We describe a classical model that may serve as an analog for joint and local measurements of an entanglement witness. The analogous experimental procedure and data analysis protocol of the model follow those of a previous experiment to measure an entanglement witness with polarized photons prepared in a mixed state [Phys. Rev. Lett. \textbf{91}, 227901 (2003)]. Numerical simulations show excellent agreement with both experimental results and quantum-mechanical predictions. This agreement is made possible by the fact that the model exhibits contextuality due to the postselection of coincident …
Exact expressions are derived for the intermediate scattering function (ISF) of a quantum particle diffusing in a harmonic potential and linearly coupled to a harmonic bath. The results are valid for arbitrary strength and spectral density of the coupling. The general, exact non-Markovian result is expressed in terms of the classical velocity autocorrelation function, which represents an accumulated phase during a scattering event. The imaginary part of the exponent of the ISF is proportional to the accumulated phase, which is an antisymmetric function of the correlation time $t$. The expressi…
Real-time clustering of big performance data generated by the telecommunication networks requires domain-specific high performance compute infrastructure to detect anomalies. In this paper, we evaluate noisy intermediate-scale quantum (NISQ) computers characterized by low decoherence times, for K-means clustering and propose three strategies to generate shorter-depth quantum circuits needed to overcome the limitation of NISQ computers. The strategies are based on exploiting; i) quantum interference, ii) negative rotations and iii) destructive interference. By comparing our implementations on I…
