A Generalized Deletion Machine
Indranil Chakrabarty, Satyabrata Adhikari
Abstract
In this work we prescribe a more generalized quantum-deleting machine (input state dependent). The fidelity of deletion is dependent on some machine parameters such that on alteration of machine parameters we get back to standard deleting machines. We also carried out a various comparative study of various kinds of quantum deleting machines. We also plotted graphs, making a comparative study of fidelity of deletion of the deletion machines, obtained as particular cases on changing the machine parameters of our machine.
Create a lesson
Related papers
An entangling Hubbard quasiparticle collider on a digital quantum processor
Chan Bin Bark, Hanbyul Kim, Yoonil Koo et al.
A Warped Born Rule Turns an Observer into a Maxwell's Demon
Olumakinde Ogunnaike
A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians
Yutaro Iiyama
Quantum Query Complexity of Maximum Degree and its Generalizations
Amin Shiraz Gilani, Nikhil S. Mande, Subhasree Patro et al.
Maximally antiflat fixed-particle-number fermionic states
Rahul Gupta, Arya Haghighian, James D. Whitfield
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
Otto Menegasso Pires, André Saimon, Daniela Herrmann et al.