👋 I'm Abhishek (Ablution) Singh, a passionate developer based in India.
Go to the Resume Page📜Pic taken at IIT Hyderabad on Wed 28 Apr 18:59:28.
[ðŸ”] I’m currently working on developing quantum software applications for real-world problems.
[🌱] I’m currently learning advanced quantum algorithms, optimization techniques & quantum programming languages.
[👯] I’m looking to collaborate on open-source quantum computing projects that push the boundaries of current technology.
[🤔] I’m looking for help with understanding and implementing quantum error correction codes.
[💬] Ask me about quantum software development, quantum algorithms, or my experiences at IIT Hyderabad!
[📫] How to reach me: You can reach me via email at abhishek-krs@alumni.iith.ac.in or connect with me on LinkedIn.com/in/Abhishek-KrS.
[😄] Pronouns: He/Him/His/Xe
[âš¡] Fun fact: I once attended a quantum computing conference where I got to meet some of the pioneers in the field!
This is a project I developed using HTML, CSS, and JavaScript. It's a responsive website for a fictional coffee shop.
View ProjectThis is a project I developed using React. It's a weather app that displays the current weather and forecast for a given location.
View ProjectThis is a project I developed using Python and Django. It's a blog website where users can create, read, update, and delete blog posts.
View ProjectGrover's Algorithm is a quantum algorithm devised by Lov Grover in 1996. It's a powerful algorithm for searching unsorted databases and provides a quadratic speedup compared to classical algorithms. In classical computing, searching an unsorted database requires checking each entry one by one, which takes linear time. However, Grover's Algorithm can search an unsorted database in roughly the square root of the number of entries, achieving a quadratic speedup. The key idea behind Grover's Algorithm is the use of quantum parallelism and quantum interference to amplify the probability of finding the correct solution. It employs the concept of quantum amplitude amplification to enhance the probability amplitudes of the correct answers while suppressing the incorrect ones. The algorithm consists of two main components: the oracle and the Grover iteration. The oracle marks the solution states, while the Grover iteration applies a series of operations to amplify the probability amplitudes of the marked states. Grover's Algorithm has various applications, including database search, optimization problems, and cryptography. It's a fundamental quantum algorithm that showcases the power of quantum computing in certain computational tasks. If you'd like more information or have any specific questions about Grover's Algorithm, feel free to ask!
View AlgorithmLet's delve into Shor's Algorithm. Shor's Algorithm, developed by mathematician Peter Shor in 1994, is a quantum algorithm that revolutionized the field of quantum computing. This algorithm is renowned for its ability to factorize large numbers exponentially faster than classical algorithms, posing a significant threat to classical RSA encryption systems. Shor's Algorithm combines principles of number theory, quantum computing, and Fourier analysis to efficiently factorize large composite numbers into their prime factors. The algorithm leverages quantum parallelism and quantum Fourier transform to perform the factorization task efficiently. The key steps of Shor's Algorithm involve quantum modular exponentiation, quantum Fourier transform, and period finding. By finding the period of a modular function, the algorithm can deduce the factors of a composite number efficiently. The implications of Shor's Algorithm are profound, particularly in the field of cryptography. It highlights the potential of quantum computing to break widely used cryptographic schemes, prompting the need for quantum-resistant cryptographic methods. Shor's Algorithm is a cornerstone in quantum computing and serves as a prime example of the advantage quantum computers hold over classical systems in certain computational tasks. If you have any more questions or need further details about Shor's Algorithm, feel free to ask!
View AlgorithmLet's explore another fascinating quantum algorithm, the Quantum Fourier Transform (QFT). The Quantum Fourier Transform is a quantum analog of the classical Discrete Fourier Transform (DFT) that plays a crucial role in various quantum algorithms, including Shor's Algorithm. The Quantum Fourier Transform operates on quantum states and can efficiently transform quantum superposition states into frequency domain states. It allows quantum computers to process information in a manner that classical computers cannot replicate efficiently. The QFT is essential in quantum algorithms due to its ability to efficiently solve problems related to period finding, amplitude estimation, and quantum phase estimation. It forms the core component of many quantum algorithms by enabling the manipulation of quantum states in a computationally advantageous way. The algorithmic structure of the Quantum Fourier Transform involves applying a series of quantum gates to quantum states, leading to a transformation that reveals the frequency components of the input state. This transformation is crucial in tasks requiring the analysis of periodicity or frequency content in quantum information. The Quantum Fourier Transform is a fundamental tool in quantum computing that underpins the functionality of various quantum algorithms. Its efficient operation on quantum states demonstrates the unique capabilities of quantum computers in processing complex information. If you have any more questions about the Quantum Fourier Transform or any other quantum algorithm, feel free to ask!
View Algorithm