Construction of virtual quantum states became possible due to the hypothesis on the nature of quantum states quant-ph/0212139. This study considers a stochastic geometrical background (stochastic gravitational background) generating correlation (or, coherency) of various quantum non-interacting objects. In the quantum state virtual model, a simple method of generating of two (or more) dichotomic signals with controlled mutual correlation factor from a single continuous stochastic process is implemented. Basing on the system random number generator of the computer, a model of the stationary random phase (with the nature of random geometrical background).
It is proposed to map the quantum information qubit not to individual spin 1/2 states, but to the collective spin states being eigenfunctions of the Hamiltonian including spin-spin interactions, which may be not small. Such an approach allows to introduce more stable calculation basis for quantum computer based on the solid state NMR systems.
Simulating chemical systems on quantum computers has been limited to a few electrons in a minimal basis. We demonstrate experimentally that the virtual quantum subspace expansion [Phys. Rev. X 10, 011004 (2020)] can achieve full basis accuracy for hydrogen and lithium dimers, comparable to simulations requiring twenty or more qubits. We developed an approach to minimize the impact of experimental noise on the stability of the generalized eigenvalue problem, a crucial component of the quantum algorithm. In addition, we were able to obtain an accurate potential energy curve for the nitrogen dime…
Currently, quantum hardware is restrained by noises and qubit numbers. Thus, a quantum virtual machine that simulates operations of a quantum computer on classical computers is a vital tool for developing and testing quantum algorithms before deploying them on real quantum computers. Various variational quantum algorithms have been proposed and tested on quantum virtual machines to surpass the limitations of quantum hardware. Our goal is to exploit further the variational quantum algorithms towards practical applications of quantum machine learning using state-of-the-art quantum computers. Thi…
Schemes of experimental realization of the main two qubit processors for quantum computers and Deutsch-Jozsa algorithm are derived in virtual spin representation. The results are applicable for every four quantum states allowing the required properties for quantum processor implementation if for qubit encoding virtual spin representation is used. Four dimensional Hilbert space of nuclear spin 3/2 is considered in details for this aim
The rapid progress in quantum computing witnessed in recent years has sparked widespread interest in developing scalable quantum information theoretic methods to work with large quantum systems. For instance, several approaches have been proposed to bypass tomographic state reconstruction, and yet retain to a certain extent the capability to estimate multiple physical properties of a given state previously measured. In this paper, we introduce the Virtual Linear Map Algorithm (VILMA), a new method that enables not only to estimate multiple operator averages using classical post-processing of i…
We propose the utilization of the IBM Quantum Experience quantum computing system to simulate different scenarios involving common hybrid quantum system components, the Nitrogen Vacancy Centre (NV centre) and the Flux Qubit. We perform a series of the simulation experiments and demonstrate properties of a virtual hybrid system, including its spin relaxation rate and state coherence. In correspondence with experimental investigations we look at the scalability of such systems and show that increasing the number of coupled NV centres decreases the coherence time. We also establish the main error…
A conception of virtual quantum information bit - virtual qubit - is introduced. It is shown by means of virtual qubit representation that four states of a single quantum particle is enough for implementation of full set of the gates, which is necessary for creation an arbitrary algorithm for a quantum computer. The physical nature and mutual disposition of four working states is of no significance, if there are suitable selection rules for the particle interaction with the external electromagnetic field pulses.
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the result, we describe a strategy to decompose a two-qubit gate to a sequence of single-qubit operations. Required operations are projective measurement of a qubit in Pauli basis, and $π/2$ rotation around x, y, and z axes. The required number of sampling to get an expectation value of a target observable within an error of $ε$ is roughly $O(9^k/ε^2)$, where $…
Importance sampling and Metropolis-Hastings sampling (of which Gibbs sampling is a special case) are two methods commonly used to sample multi-variate probability distributions (that is, Bayesian networks). Heretofore, the sampling of Bayesian networks has been done on a conventional "classical computer". In this paper, we propose methods for doing importance sampling and Metropolis-Hastings sampling of a classical Bayesian network on a quantum computer.
The field of quantum information has matured and various protocols implementing a quantum computer are being pursued. Most similar to a classical computer is the circuit model. In 2007 Aharonov et al. showed the equivalence between the circuit model and a quantum annealer, and with this proofed the universality of quantum annealing. Here the system starts in an easily preparable ground state and evolves adiabatically to a final ground state which yields the solution of the computational problem. However, equivalence with the circuit model requires multi-local interactions, i.e. interaction ter…
Virtual black-box obfuscation is a strong cryptographic primitive: it encrypts a circuit while maintaining its full input/output functionality. A remarkable result by Barak et al. (Crypto 2001) shows that a general obfuscator that obfuscates classical circuits into classical circuits cannot exist. A promising direction that circumvents this impossibility result is to obfuscate classical circuits into quantum states, which would potentially be better capable of hiding information about the obfuscated circuit. We show that, under the assumption that learning-with-errors (LWE) is hard for quantum…
Quantum Computers, one fully realized, can represent an exponential boost in computing power. However, the computational power of the current quantum computers, referred to as Noisy Internediate Scale Quantum, or NISQ, is severely limited because of environmental and intrinsic noise, as well as the very low connectivity between qubits compared to their total amount. We propose a virtual quantum processor that emulates a generic hybrid quantum machine which can serve as a logical version of quantum computing hardware. This hybrid classical quantum machine powers quantum-logical computations whi…
Investigating student interpretations of the differences between classical and quantum computers: Are quantum computers just analog classical computers?
It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen "Free Will" theorems.
Classical simulation is important because it sets a benchmark for quantum computer performance. Classical simulation is currently the only way to exercise larger numbers of qubits. To achieve larger simulations, sparse matrix processing is emphasized below while trading memory for processing. It performed well within NCSA supercomputers, giving a state vector in convenient continuous portions ready for post processing.
The correspondence between classical extra dimensional geometry and quantum behavior, typical of the AdS/CFT, has a heuristic semiclassical interpretation in terms of undulatory mechanics and relativistic geometrodynamics. We note, in fact, that the quantum recurrence of ordinary particles enters into the equations of motions in formal duality with the extra dimensional dynamics of a Kaluza-Klein theory. The kinematics of the particle in a generic interaction scheme can be described as modulations of the spacetime recurrences and encoded in corresponding geometrodynamics. The quantization can …
