ON THE PRACTICALITY OF ADIABATIC QUANTUM COMPUTING WITH OPTICAL SCHEMES

2007 ◽  
Vol 05 (01n02) ◽  
pp. 179-188 ◽  
Author(s):  
DEBABRATA GOSWAMI

A robust implementation of quantum logical gates for a multilevel system is possible through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. Selective population inversion and Hamiltonian evolution with time through ultrafast pulse shaping techniques essentially amount to adiabatic quantum computing (AQC) instead of the standard unitary transformation. An important aspect of the AQC model is in addressing the atomic or molecular ensemble and hence in robust implementation. We argue that experimental demonstrations of selective population transfer through adiabatic rapid passage form useful adiabatic quantum computing logic. Similarly, a simple Hadamard operation can be demonstrated with phase-modulated laser pulses. Finally, we present a framework to efficiently solve approximate Euclidean Traveling Salesman Problem (Approx-TSP) with bounded error in the AQC model. We present an efficient and intuitive encoding for Approx-TSP in a quantum computing paradigm. Optical approaches to quantum computing have the potential to be used in a distributive sense to defray the present caveat of limited resources and scalability. We present how we make use of such schemes towards practicality issues in AQC. As far as we know, our results are the first realistic demonstration of the possibility of using ensemble states for AQC in multilevel systems.

2021 ◽  
Vol 15 (2) ◽  
Author(s):  
Narendra N. Hegade ◽  
Koushik Paul ◽  
Yongcheng Ding ◽  
Mikel Sanz ◽  
F. Albarrán-Arriagada ◽  
...  

2009 ◽  
Vol 9 (5&6) ◽  
pp. 487-499
Author(s):  
S.S. Bullock ◽  
D.P. O'Leary

In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of $k$-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether or not its Pauli tensor summands commute. Our results provide insight into the cost of creating an energy gap for passive error correction and for adiabatic quantum computing. The results simplify in the cases of XZ-split codes such as Calderbank-Shor-Steane stabilizer codes and topologically-ordered stabilizer codes arising from surface cellulations.


2018 ◽  
pp. 563-588
Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.


Author(s):  
Krishna Asawa ◽  
Akanksha Bhardwaj

With the emergence of technological revolution to host services over Internet, secure communication over World Wide Web becomes critical. Cryptographic protocols are being in practice to secure the data transmission over network. Researchers use complex mathematical problem, number theory, prime numbers etc. to develop such cryptographic protocols. RSA and Diffie Hellman public key crypto systems have proven to be secure due to the difficulty of factoring the product of two large primes or computing discrete logarithms respectively. With the advent of quantum computers a new paradigm shift on public key cryptography may be on horizon. Since superposition of the qubits and entanglement behavior exhibited by quantum computers could hold the potential to render most modern encryption useless. The aim of this chapter is to analyze the implications of quantum computing power on current public key cryptosystems and to show how these cryptosystems can be restructured to sustain in the new computing paradigm.


Sign in / Sign up

Export Citation Format

Share Document