Quasi-Chaotic Oscillators Based on Modular Quantum Circuits
- URL: http://arxiv.org/abs/2203.14029v2
- Date: Mon, 18 Apr 2022 15:04:19 GMT
- Title: Quasi-Chaotic Oscillators Based on Modular Quantum Circuits
- Authors: Andrea Ceschini, Antonello Rosato, Massimo Panella
- Abstract summary: We propose the implementation of a quasi-chaotic oscillator based on quantum modular addition and multiplication.
We prove that quantum computing allows the parallel processing of data, paving the way for a fast and robust multi-channel encryption/decryption scheme.
- Score: 3.383942690870476
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Digital circuits based on residue number systems have been considered to
produce a pseudo-random behavior. The present work is an initial step towards
the complete implementation of those systems for similar applications using
quantum technology. We propose the implementation of a quasi-chaotic oscillator
based on quantum modular addition and multiplication and we prove that quantum
computing allows the parallel processing of data, paving the way for a fast and
robust multi-channel encryption/decryption scheme. The resulting structure is
assessed by several experiments in order to ascertain the desired noise-like
behavior.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Multivariable QSP and Bosonic Quantum Simulation using Iterated Quantum Signal Processing [0.5097809301149342]
We provide a form of Modular Quantum Signal Processing that we call iterated quantum signal processing.
This method applies quantum signal processing to the outputs of other quantum signal processing steps.
We discuss how these ideas can be used to construct phase functions relevant for quantum simulation.
arXiv Detail & Related papers (2024-08-06T15:27:43Z) - Unified framework for efficiently computable quantum circuits [0.0]
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer.
We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
arXiv Detail & Related papers (2024-01-16T08:04:28Z) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Efficient realization of quantum algorithms with qudits [0.70224924046445]
We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits)
Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor.
We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
arXiv Detail & Related papers (2021-11-08T11:09:37Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z) - Randomizing multi-product formulas for Hamiltonian simulation [2.2049183478692584]
We introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas on the other.
Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification.
Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth.
arXiv Detail & Related papers (2021-01-19T19:00:23Z) - Variational certification of quantum devices [0.0]
We describe a simple procedure based on variational quantum eigensolver which can be utilized to compare quantum devices.
We provide numerical results demonstrating its feasibility in realistic scenarios by running the procedure on IBM quantum computer.
arXiv Detail & Related papers (2020-11-03T17:56:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.