This page has only limited features, please log in for full access.
We present a new quantum heuristic algorithm aimed at finding satisfying assignments for hard K-SAT instances using a continuous time quantum walk that explicitly exploits the properties of quantum tunneling. Our algorithm uses a Hamiltonian \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_A(F)$$\end{document}HA(F) which is specifically constructed to solve a K-SAT instance F. The heuristic algorithm aims at iteratively reducing the Hamming distance between an evolving state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _j}\rangle }$$\end{document}|ψj⟩ and a state that represents a satisfying assignment for F. Each iteration consists on the evolution of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{\psi _j}\rangle }$$\end{document}|ψj⟩ (where j is the iteration number) under \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e^{-iH_At}$$\end{document}e-iHAt, a measurement that collapses the superposition, a check to see if the post-measurement state satisfies F and in the case it does not, an update to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_A$$\end{document}HA for the next iteration. Operator \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_A$$\end{document}HA describes a continuous time quantum walk over a hypercube graph with potential barriers that makes an evolving state to scatter and mostly follow the shortest tunneling paths with the smaller potentials that lead to a state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{s}\rangle }$$\end{document}|s⟩ that represents a satisfying assignment for F. The potential barriers in the Hamiltonian \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_A$$\end{document}HA are constructed through a process that does not require any previous knowledge on the satisfying assignments for the instance F. Due to the topology of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$H_A$$\end{document}HA each iteration is expected to reduce the Hamming distance between each post measurement state and a state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{s}\rangle }$$\end{document}|s⟩. If the state \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{s}\rangle }$$\end{document}|s⟩ is not measured after n iterations (the number n of logical variables in the instance F being solved), the algorithm is restarted. Periodic measurements and quantum tunneling also give the possibility of getting out of local minima. Our numerical simulations show a success rate of 0.66 on measuring \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${|{s}\rangle }$$\end{document}|s⟩ on the first run of the algorithm (i.e., without restarting after n iterations) on thousands of 3-SAT instances of 4, 6, and 10 variables with unique satisfying assignments.
Ernesto Campos; Salvador E. Venegas-Andraca; Marco Lanzagorta. Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances. Scientific Reports 2021, 11, 1 .
AMA StyleErnesto Campos, Salvador E. Venegas-Andraca, Marco Lanzagorta. Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances. Scientific Reports. 2021; 11 ():1.
Chicago/Turabian StyleErnesto Campos; Salvador E. Venegas-Andraca; Marco Lanzagorta. 2021. "Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances." Scientific Reports 11, no. : 1.
A bilinear interpolation technique is proposed for flexible representations of quantum images (FRQIs). In this process, several quantum modules were developed, including assignment, increment, and quarter modules, for use in an interpolation circuit. The network structure of these circuits, capable of both up-sampling and down-sampling FRQIs, was investigated as part of the study. Additionally, the proposed method was verified using a series of simulation experiments in which test samples were enlarged and reduced, for comparison with nearest-neighbor interpolation. The up-scaled images produced using the proposed technique were of higher quality than those produced using nearest-neighbor interpolation, as measured using the peak signal-to-noise ratio (PSNR) and the structural similarity index (SSIM). Finally, with the extension of the FRQI model from square to rectangular shapes, the proposed algorithm is used to process rectangular FRQIs with special and arbitrary sizes.
Fei Yan; Shan Zhao; Salvador E. Venegas-Andraca; Kaoru Hirota. Implementing bilinear interpolation with quantum images. Digital Signal Processing 2021, 117, 103149 .
AMA StyleFei Yan, Shan Zhao, Salvador E. Venegas-Andraca, Kaoru Hirota. Implementing bilinear interpolation with quantum images. Digital Signal Processing. 2021; 117 ():103149.
Chicago/Turabian StyleFei Yan; Shan Zhao; Salvador E. Venegas-Andraca; Kaoru Hirota. 2021. "Implementing bilinear interpolation with quantum images." Digital Signal Processing 117, no. : 103149.
Blockchain plays a vital task in cybersecurity. With the exerted efforts for realising large-scale quantum computers, most current cryptographic mechanisms may be hacked. Accordingly, we need a quantum tool utilised for designing blockchain frameworks to have the ability to be executed in the level of digital computers and resist the probable attacks from both digital and quantum computers. Quantum walks may be utilised as a quantum-inspired model for designing new cryptographic algorithms. In this paper, we present a new authentication and encryption protocol based on quantum-inspired quantum walks (QIQW). The proposed protocol is utilized to build a blockchain framework for secure data transmission among IoT devices. Instead of using classical cryptographic hash functions, quantum hash functions based on QIQW are employed for linking blocks of the chain. The main advantages of the presented framework are helping IoT nodes to effectively share their data with other nodes and full control of their records. Security analysis demonstrates that our proposed protocol can defend against message attack and impersonation attacks, thus ensuring secure transmission of data among IoT devices.
Ahmed A. Abd El-Latif; Bassem Abd-El-Atty; Irfan Mehmood; Khan Muhammad; Salvador E. Venegas-Andraca; Jialiang Peng. Quantum-Inspired Blockchain-Based Cybersecurity: Securing Smart Edge Utilities in IoT-Based Smart Cities. Information Processing & Management 2021, 58, 102549 .
AMA StyleAhmed A. Abd El-Latif, Bassem Abd-El-Atty, Irfan Mehmood, Khan Muhammad, Salvador E. Venegas-Andraca, Jialiang Peng. Quantum-Inspired Blockchain-Based Cybersecurity: Securing Smart Edge Utilities in IoT-Based Smart Cities. Information Processing & Management. 2021; 58 (4):102549.
Chicago/Turabian StyleAhmed A. Abd El-Latif; Bassem Abd-El-Atty; Irfan Mehmood; Khan Muhammad; Salvador E. Venegas-Andraca; Jialiang Peng. 2021. "Quantum-Inspired Blockchain-Based Cybersecurity: Securing Smart Edge Utilities in IoT-Based Smart Cities." Information Processing & Management 58, no. 4: 102549.
Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunnelling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behaviour and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time T D , QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e. 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e. larger genotype networks) in both closed and open systems (e.g. by considering Lindblad terms).
Diego Santiago-Alarcon; Horacio Tapia-McClung; Sergio Lerma-Hernandez; Salvador E. Venegas-Andraca. Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks. Journal of The Royal Society Interface 2020, 17, 20200567 .
AMA StyleDiego Santiago-Alarcon, Horacio Tapia-McClung, Sergio Lerma-Hernandez, Salvador E. Venegas-Andraca. Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks. Journal of The Royal Society Interface. 2020; 17 (172):20200567.
Chicago/Turabian StyleDiego Santiago-Alarcon; Horacio Tapia-McClung; Sergio Lerma-Hernandez; Salvador E. Venegas-Andraca. 2020. "Quantum aspects of evolution: a contribution towards evolutionary explorations of genotype networks via quantum walks." Journal of The Royal Society Interface 17, no. 172: 20200567.
Quantum biology seeks to explain biological phenomena via quantum mechanisms, such as enzyme reaction rates via tunneling and photosynthesis energy efficiency via coherent superposition of states. However, less effort has been devoted to study the role of quantum mechanisms in biological evolution. In this paper, we used transcription factor networks with two and four different phenotypes, and used classical random walks (CRW) and quantum walks (QW) to compare network search behavior and efficiency at finding novel phenotypes between CRW and QW. In the network with two phenotypes, at temporal scales comparable to decoherence time TD, QW are as efficient as CRW at finding new phenotypes. In the case of the network with four phenotypes, the QW had a higher probability of mutating to a novel phenotype than the CRW, regardless of the number of mutational steps (i.e., 1, 2 or 3) away from the new phenotype. Before quantum decoherence, the QW probabilities become higher turning the QW effectively more efficient than CRW at finding novel phenotypes under different starting conditions. Thus, our results warrant further exploration of the QW under more realistic network scenarios (i.e., larger genotype networks) in both closed and open systems (e.g., by considering Lindblad terms).
Diego Santiago-Alarcon; Horacio Tapia-McClung; Sergio Adrian Lerma-Hernandez; Salvador E. Venegas-Andraca. Quantum aspects of evolution: a contribution toward evolutionary explorations of genotype networks via quantum walks. 2020, 1 .
AMA StyleDiego Santiago-Alarcon, Horacio Tapia-McClung, Sergio Adrian Lerma-Hernandez, Salvador E. Venegas-Andraca. Quantum aspects of evolution: a contribution toward evolutionary explorations of genotype networks via quantum walks. . 2020; ():1.
Chicago/Turabian StyleDiego Santiago-Alarcon; Horacio Tapia-McClung; Sergio Adrian Lerma-Hernandez; Salvador E. Venegas-Andraca. 2020. "Quantum aspects of evolution: a contribution toward evolutionary explorations of genotype networks via quantum walks." , no. : 1.
Fifth generation (5G) networks are the base communication technology for connecting objects in the internet of things (IoT) environment. 5G is being developed to provide extremely large capacity, robust integrity, high bandwidth, and low latency. With the development and innovating new techniques for 5G-IoT, it surely will drive to new enormous security and privacy challenges. Consequently, secure techniques for data transmissions will be needed as the basis for 5G-IoT technology to address these arising challenges. Therefore, various traditional security mechanisms are provided for 5G-IoT technologies and most of them are based on mathematical models. With the growth and development of quantum technologies, traditional cryptographic techniques may be compromised due to their mathematical computation based construction. Quantum walks (QWs) is a universal model of quantum computation, which possesses inherent cryptographic features that can be utilized to build efficient cryptographic mechanisms. In this paper, we utilize the features of quantum walks to construct a new S-box method which plays a significant role in block cipher techniques for 5G-IoT technologies. As an application of the presented S-box mechanism and controlled alternate quantum walks (CAQWs) for 5G-IoT technologies a new robust video encryption mechanism is proposed. As well as to fulfill needs of encryption for varied files in 5G-IoT, we utilize the features of quantum walks to design a novel encryption technique for secure transmission of sensitive files in 5G-IoT paradigm. The analyses and results of the proposed cryptosystems show that it has better security properties and efficacy in terms of cryptographic performance.
Ahmed A. Abd El-Latif; Bassem Abd-El-Atty; Wojciech Mazurczyk; Carol Fung; Salvador Elias Venegas-Andraca. Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario. IEEE Transactions on Network and Service Management 2020, 17, 118 -131.
AMA StyleAhmed A. Abd El-Latif, Bassem Abd-El-Atty, Wojciech Mazurczyk, Carol Fung, Salvador Elias Venegas-Andraca. Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario. IEEE Transactions on Network and Service Management. 2020; 17 (1):118-131.
Chicago/Turabian StyleAhmed A. Abd El-Latif; Bassem Abd-El-Atty; Wojciech Mazurczyk; Carol Fung; Salvador Elias Venegas-Andraca. 2020. "Secure Data Encryption Based on Quantum Walks for 5G Internet of Things Scenario." IEEE Transactions on Network and Service Management 17, no. 1: 118-131.
The development of quantum computers and quantum algorithms conveys a challenging scenario for several cryptographic protocols due to the mathematical scaffolding upon which those protocols have been built. Quantum walks constitute a universal quantum computational model which is widely used in various fields, including quantum algorithms and cryptography. Quantum walks can be utilized as a powerful tool for the development of modern chaos-based cryptographic applications due to their nonlinear dynamical behavior and high sensitivity to initial conditions. In this paper, we propose new encryption mechanism for privacy preserving Internet of Things-based healthcare systems in order to protect the patients’ privacy. The encryption/decryption processes are based on controlled alternate quantum walks. The proposed cryptosystem approach is composed of two phases: substitution and permutation, both based on independently computed quantum walks. Simulation results and numerical analysis of our data provide enough evidence to reasonably conjecture that our image encryption protocol is robust and efficient for protecting patients’ privacy protection.
Ahmed A. Abd El-Latif; Bassem Abd-El-Atty; Eman M. Abou-Nassar; Salvador E. Venegas-Andraca. Controlled alternate quantum walks based privacy preserving healthcare images in Internet of Things. Optics & Laser Technology 2019, 124, 105942 .
AMA StyleAhmed A. Abd El-Latif, Bassem Abd-El-Atty, Eman M. Abou-Nassar, Salvador E. Venegas-Andraca. Controlled alternate quantum walks based privacy preserving healthcare images in Internet of Things. Optics & Laser Technology. 2019; 124 ():105942.
Chicago/Turabian StyleAhmed A. Abd El-Latif; Bassem Abd-El-Atty; Eman M. Abou-Nassar; Salvador E. Venegas-Andraca. 2019. "Controlled alternate quantum walks based privacy preserving healthcare images in Internet of Things." Optics & Laser Technology 124, no. : 105942.
Quantum annealing algorithms were introduced to solve combinatorial optimization problems by taking advantage of quantum fluctuations to escape local minima in complex energy landscapes typical of NP − hard problems. In this work, we propose using quantum annealing for the theory of cuts, a field of paramount importance in theoretical computer science. We have proposed a method to formulate the Minimum Multicut Problem into the QUBO representation, and the technical difficulties faced when embedding and submitting a problem to the quantum annealer processor. We show two constructions of the quadratic unconstrained binary optimization functions for the Minimum Multicut Problem and we review several tradeoffs between the two mappings and provide numerical scaling analysis results from several classical approaches. Furthermore, we discuss some of the expected challenges and tradeoffs in the implementation of our mapping in the current generation of D-Wave machines.
William Cruz-Santos; Salvador E. Venegas-Andraca; Marco Lanzagorta. A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers. Scientific Reports 2019, 9, 1 -12.
AMA StyleWilliam Cruz-Santos, Salvador E. Venegas-Andraca, Marco Lanzagorta. A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers. Scientific Reports. 2019; 9 (1):1-12.
Chicago/Turabian StyleWilliam Cruz-Santos; Salvador E. Venegas-Andraca; Marco Lanzagorta. 2019. "A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers." Scientific Reports 9, no. 1: 1-12.
This paper proposes an efficient and secure quantum video encryption algorithm for quantum videos based on qubit-planes controlled-XOR operations and improved logistic map in multi-layer encryption steps. Three simple cryptosystem steps are presented in the proposed approach to accomplish the whole encryption process: inter-frame permutation, intra-frame pixel position geometric transformation, and high 4-intra-frame-qubit-planes scrambling. Firstly, the inter-frame positions of quantum video are permutated via inter-frame permutation that is controlled by the keys which are generated by improved logistic map. Secondly, intra-frame pixel positions are encrypted by intra-frame pixel position geometric transformation and improved logistic map. Finally, the high 4-intra-frame-qubit-planes are scrambled via quantum controlled-XOR operations and improved logistic map. Experiments conducted demonstrate that the proposed quantum video encryption approach has high efficiency with simple calculation, low complexity and strongly filtrates in security applications like video on demand, video conference.
Xian-Hua Song; Hui-Qiang Wang; Salvador E. Venegas-Andraca; Ahmed A. Abd El-Latif. Quantum video encryption based on qubit-planes controlled-XOR operations and improved logistic map. Physica A: Statistical Mechanics and its Applications 2019, 537, 122660 .
AMA StyleXian-Hua Song, Hui-Qiang Wang, Salvador E. Venegas-Andraca, Ahmed A. Abd El-Latif. Quantum video encryption based on qubit-planes controlled-XOR operations and improved logistic map. Physica A: Statistical Mechanics and its Applications. 2019; 537 ():122660.
Chicago/Turabian StyleXian-Hua Song; Hui-Qiang Wang; Salvador E. Venegas-Andraca; Ahmed A. Abd El-Latif. 2019. "Quantum video encryption based on qubit-planes controlled-XOR operations and improved logistic map." Physica A: Statistical Mechanics and its Applications 537, no. : 122660.
Quantum walks are generalizations of random walks that have extensive applications in various fields including cryptography, quantum algorithms, and quantum networking. Discrete quantum walks can be seen as nonlinear mappings between quantum states and position probability distributions, and this mathematical property may be thought of as an imprint of chaotic behavior and consequently used to generate encryption keys. In this paper, we introduce encryption and decryption algorithms for NEQR images based on discrete quantum walks on a circle. We present full quantum circuits of proposed encryption and decryption algorithms together with digital computer simulations of most common attacks on encrypted images. Our numerical results show that our quantum image encryption and decryption scheme has high efficiency and high security with high large key space.
Bassem Abd-El-Atty; Ahmed A. Abd El-Latif; Salvador E. Venegas-Andraca. An encryption protocol for NEQR images based on one-particle quantum walks on a circle. Quantum Information Processing 2019, 18, 1 -26.
AMA StyleBassem Abd-El-Atty, Ahmed A. Abd El-Latif, Salvador E. Venegas-Andraca. An encryption protocol for NEQR images based on one-particle quantum walks on a circle. Quantum Information Processing. 2019; 18 (9):1-26.
Chicago/Turabian StyleBassem Abd-El-Atty; Ahmed A. Abd El-Latif; Salvador E. Venegas-Andraca. 2019. "An encryption protocol for NEQR images based on one-particle quantum walks on a circle." Quantum Information Processing 18, no. 9: 1-26.
Fifth generation (5G) networks aim at utilizing many promising communication technologies, such as Cloud Computing, Network Slicing, and Software Defined Networking. Supporting a massive number of connected devices with 5G advanced technologies and innovating new techniques will surely bring tremendous challenges for trust, security and privacy. Therefore, secure mechanisms and protocols are required as the basis for 5G networks to address this security challenges and follow security-by-design but also security-by-operations rules. In this context, new efficient cryptographic protocols and mechanisms are needed in order to design and achieve information sharing and data protection protocols in 5G networks. In the literature, several security schemes based on unproven assumptions of computational complexity and mathematical models were proposed. However, the cryptanalysis is able to break most of the existing proposals in the presence of several weakest links in the designs. Recently, quantum walks (QWs) have been introduced as an excellent mechanism for generating cryptographic keys due to its nonlinear chaotic dynamical performance, high sensitivity to initial control parameters, stability and very large key space theoretically strong enough to resist various known attacks. This paper firstly proposes two efficient hash function mechanisms for 5G networks applications based on QWs, namely QWHF-1 and QWHF-2. Then, based on these hash functions, two efficient security protocols for securing data in 5G network scenario are proposed. Performance analyses and simulation results show that the proposed approaches are characterized with high security, efficiency, and robustness against several well-known attacks which nominate them as excellent candidates for securing 5G applications.
Ahmed A. Abd El-Latif; Bassem Abd-El-Atty; Salvador E. Venegas-Andraca; Wojciech Mazurczyk. Efficient quantum-based security protocols for information sharing and data protection in 5G networks. Future Generation Computer Systems 2019, 100, 893 -906.
AMA StyleAhmed A. Abd El-Latif, Bassem Abd-El-Atty, Salvador E. Venegas-Andraca, Wojciech Mazurczyk. Efficient quantum-based security protocols for information sharing and data protection in 5G networks. Future Generation Computer Systems. 2019; 100 ():893-906.
Chicago/Turabian StyleAhmed A. Abd El-Latif; Bassem Abd-El-Atty; Salvador E. Venegas-Andraca; Wojciech Mazurczyk. 2019. "Efficient quantum-based security protocols for information sharing and data protection in 5G networks." Future Generation Computer Systems 100, no. : 893-906.
In this paper, we propose a methodology to solve the stereo matching problem through quantum annealing optimization. Our proposal takes advantage of the existing Min-Cut/Max-Flow network formulation of computer vision problems. Based on this network formulation, we construct a quadratic pseudo-Boolean function and then optimize it through the use of the D-Wave quantum annealing technology. Experimental validation using two kinds of stereo pair of images, random dot stereograms and gray-scale, shows that our methodology is effective.
William Cruz-Santos; Salvador E. Venegas-Andraca; Marco Lanzagorta. A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers. Entropy 2018, 20, 786 .
AMA StyleWilliam Cruz-Santos, Salvador E. Venegas-Andraca, Marco Lanzagorta. A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers. Entropy. 2018; 20 (10):786.
Chicago/Turabian StyleWilliam Cruz-Santos; Salvador E. Venegas-Andraca; Marco Lanzagorta. 2018. "A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers." Entropy 20, no. 10: 786.
Salvador E. Venegas-Andraca; William Cruz-Santos; Catherine McGeoch; Marco Lanzagorta. A cross-disciplinary introduction to quantum annealing-based algorithms. Contemporary Physics 2018, 59, 174 -197.
AMA StyleSalvador E. Venegas-Andraca, William Cruz-Santos, Catherine McGeoch, Marco Lanzagorta. A cross-disciplinary introduction to quantum annealing-based algorithms. Contemporary Physics. 2018; 59 (2):174-197.
Chicago/Turabian StyleSalvador E. Venegas-Andraca; William Cruz-Santos; Catherine McGeoch; Marco Lanzagorta. 2018. "A cross-disciplinary introduction to quantum annealing-based algorithms." Contemporary Physics 59, no. 2: 174-197.
We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the case of a non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.
Radhakrishnan Balu; Chaobin Liu; Salvador E Venegas-Andraca. Probability distributions for Markov chain based quantum walks. Journal of Physics A: Mathematical and Theoretical 2017, 51, 035301 .
AMA StyleRadhakrishnan Balu, Chaobin Liu, Salvador E Venegas-Andraca. Probability distributions for Markov chain based quantum walks. Journal of Physics A: Mathematical and Theoretical. 2017; 51 (3):035301.
Chicago/Turabian StyleRadhakrishnan Balu; Chaobin Liu; Salvador E Venegas-Andraca. 2017. "Probability distributions for Markov chain based quantum walks." Journal of Physics A: Mathematical and Theoretical 51, no. 3: 035301.
In this paper, a novel method of quantum image rotation (QIR) based on shear transformations on NEQR quantum images is proposed. To compute the horizontal and vertical shear mappings required for rotation, we have designed quantum self-adder, quantum control multiplier, and quantum interpolation circuits as the basic computing units in the QIR implementation. Furthermore, we provide several examples of our results by presenting computer simulation experiments of QIR under \(30^\circ \), \(45^\circ \), and \(60^\circ \) rotation scenarios and have a discussion onto the anti-aliasing and computational complexity of the proposed QIR method.
Fei Yan; Kehan Chen; Salvador E. Venegas-Andraca; Jianping Zhao. Quantum image rotation by an arbitrary angle. Quantum Information Processing 2017, 16, 282 .
AMA StyleFei Yan, Kehan Chen, Salvador E. Venegas-Andraca, Jianping Zhao. Quantum image rotation by an arbitrary angle. Quantum Information Processing. 2017; 16 (11):282.
Chicago/Turabian StyleFei Yan; Kehan Chen; Salvador E. Venegas-Andraca; Jianping Zhao. 2017. "Quantum image rotation by an arbitrary angle." Quantum Information Processing 16, no. 11: 282.
Salvador Elías Venegas-Andraca. Introductory words: Special issue on quantum image processing published by Quantum Information Processing. Quantum Information Processing 2015, 14, 1535 -1537.
AMA StyleSalvador Elías Venegas-Andraca. Introductory words: Special issue on quantum image processing published by Quantum Information Processing. Quantum Information Processing. 2015; 14 (5):1535-1537.
Chicago/Turabian StyleSalvador Elías Venegas-Andraca. 2015. "Introductory words: Special issue on quantum image processing published by Quantum Information Processing." Quantum Information Processing 14, no. 5: 1535-1537.
Image segmentation methods based on spectral graph theory, although capable of overcoming some of the drawbacks of the so-called “central”-grouping methods, are computationally expensive and quickly become infeasible to solve as the size of the image grows. As a counter measure, the Nyström approximation allows to extrapolate the complete grouping solution for these methods using only a proportionally smaller set of samples instead of the whole pixels that compose the image. In this correspondence, we further explore the Nyström approximation by taking the concept of “regions”, pixels of the image previously grouped by a central method, to both reduce the computational resources required and provide a finer segmentation of the image by combining the strengths of both methods. We apply the proposed approach to the segmentation of images of burns where we attempt to extract regions that would roughly correspond to the different degrees of the lesion.
Juan F. García García; Salvador E. Venegas-Andraca. Region-based approach for the spectral clustering Nyström approximation with an application to burn depth assessment. Machine Vision and Applications 2015, 26, 353 -368.
AMA StyleJuan F. García García, Salvador E. Venegas-Andraca. Region-based approach for the spectral clustering Nyström approximation with an application to burn depth assessment. Machine Vision and Applications. 2015; 26 (2-3):353-368.
Chicago/Turabian StyleJuan F. García García; Salvador E. Venegas-Andraca. 2015. "Region-based approach for the spectral clustering Nyström approximation with an application to burn depth assessment." Machine Vision and Applications 26, no. 2-3: 353-368.
Note: In lieu of an abstract, this is an excerpt from the first page.Excerpt The authors wish to make the following corrections to this paper [1]: The correct name of the fourth author is: Ahmed S. Salama. In the Acknowledgment Section, we added the research Project No. 2014/01/2079. Below is the corrected version of the section.
Abdullah M. Iliyasu; Salvador E. Venegas-Andraca; Fei Yan; Ahmed S. Salama. Correction on Iliyasu, A.M. et al. Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information. Entropy, 2014, 16, 3537-3551. Entropy 2014, 16, 6382 -6383.
AMA StyleAbdullah M. Iliyasu, Salvador E. Venegas-Andraca, Fei Yan, Ahmed S. Salama. Correction on Iliyasu, A.M. et al. Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information. Entropy, 2014, 16, 3537-3551. Entropy. 2014; 16 (12):6382-6383.
Chicago/Turabian StyleAbdullah M. Iliyasu; Salvador E. Venegas-Andraca; Fei Yan; Ahmed S. Salama. 2014. "Correction on Iliyasu, A.M. et al. Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information. Entropy, 2014, 16, 3537-3551." Entropy 16, no. 12: 6382-6383.
In this paper we present a hybrid (i.e., quantum-classical) adaptive protocol for the storage and retrieval of discrete-valued information. The purpose of this paper is to introduce a procedure that exhibits how to store and retrieve unanticipated information values by using a quantum property, that of using different vector space bases for preparation and measurement of quantum states. This simple idea leads to an interesting old wish in Artificial Intelligence: the development of computer systems that can incorporate new knowledge on a real-time basis just by hardware manipulation.
Abdullah M. Iliyasu; Salvador E. Venegas-Andraca; Fei Yan; Ahmed Sayed. Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information. Entropy 2014, 16, 3537 -3551.
AMA StyleAbdullah M. Iliyasu, Salvador E. Venegas-Andraca, Fei Yan, Ahmed Sayed. Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information. Entropy. 2014; 16 (6):3537-3551.
Chicago/Turabian StyleAbdullah M. Iliyasu; Salvador E. Venegas-Andraca; Fei Yan; Ahmed Sayed. 2014. "Hybrid Quantum-Classical Protocol for Storage and Retrieval of Discrete-Valued Information." Entropy 16, no. 6: 3537-3551.
Physical implementations of quantum key distribution (QKD) protocols, like the Bennett-Brassard (BB84), are forced to use attenuated coherent quantum states, because the sources of single photon states are not functional yet for QKD applications. However, when using attenuated coherent states, the relatively high rate of multi-photonic pulses introduces vulnerabilities that can be exploited by the photon number splitting (PNS) attack to brake the quantum key. Some QKD protocols have been developed to be resistant to the PNS attack, like the decoy method, but those define a single photonic gain in the quantum channel. To overcome this limitation, we have developed a new QKD protocol, called ack-QKD, which is resistant to the PNS attack. Even more, it uses attenuated quantum states, but defines two interleaved photonic quantum flows to detect the eavesdropper activity by means of the quantum photonic error gain (QPEG) or the quantum bit error rate (QBER). The physical implementation of the ack-QKD is similar to the well-known BB84 protocol.
Luis A. Lizama-Pérez; J. Mauricio Lopez; Eduardo De Carlos-Lopez; Salvador E. Venegas-Andraca. Quantum Flows for Secret Key Distribution in the Presence of the Photon Number Splitting Attack. Entropy 2014, 16, 3121 -3135.
AMA StyleLuis A. Lizama-Pérez, J. Mauricio Lopez, Eduardo De Carlos-Lopez, Salvador E. Venegas-Andraca. Quantum Flows for Secret Key Distribution in the Presence of the Photon Number Splitting Attack. Entropy. 2014; 16 (6):3121-3135.
Chicago/Turabian StyleLuis A. Lizama-Pérez; J. Mauricio Lopez; Eduardo De Carlos-Lopez; Salvador E. Venegas-Andraca. 2014. "Quantum Flows for Secret Key Distribution in the Presence of the Photon Number Splitting Attack." Entropy 16, no. 6: 3121-3135.