SVSanjay Vishwakarma

Sanjay Vishwakarma

*This is an algorithmically generated author record based on publicly available information.

Sanjay Vishwakarma has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Efficient VQE Approach for Accurate Simulations on the Kagome Lattice

    by S. Jyothikamalesh, A. Kaarnika, M. Mohankumar, Sanjay Vishwakarma, Srinjoy Ganguly, P. Yuvaraj


  • Open Access

    Quantum Circuit Optimization of Arithmeticcircuits using ZX Calculus

    by Aravind Joshi, Akshara Kairali, Renju Raju, Adithya Athreya, Sanjay Vishwakarma, Srinjoy Ganguly, Reena Monica P

    Quantum computing is an emerging technology in which quantum mechanicalproperties are suitably utilized to perform certain compute-intensive operationsfaster than classical computers. Quantum algorithms are designed as a combinationof quantum circuits that each require a large number of quantum gates,which is a challenge considering the limited number of qubit resources available inquantum computing systems. Our work proposes a technique to optimize quantumarithmetic algorithms by reducing the hardware resources and the numberof qubits based on ZX calculus. We have utilised ZX calculus rewrite rules forthe optimization of fault-tolerant quantum multiplier circuits where we are ableto achieve a significant reduction in the number of ancilla bits and T-gates ascompared to the originally required numbers to achieve fault-tolerance. Our workis the first step in the series of arithmetic circuit optimization using graphicalrewrite tools and it paves the way for advancing the optimization of various complexquantum circuits and establishing the potential for new applications of thesame


  • Open Access

    From Portfolio Optimization to Quantum Blockchain and Security: A Systematic Review of Quantum Computing in Finance

    by Abha Naik, Esra Yeniaras, Gerhard Hellstern, Grishma Prasad, Sanjay Kumar Lalta Prasad Vishwakarma

    In this paper, we provide an overview of the recent work in the quantum finance realm from various perspectives. The applications in consideration are Portfolio Optimization, Fraud Detection, and Monte Carlo methods for derivative pricing and risk calculation. Furthermore, we give a comprehensive overview of the applications of quantum computing in the field of blockchain technology which is a main concept in fintech. In that sense, we first introduce the general overview of blockchain with its main cryptographic primitives such as digital signature algorithms, hash functions, and random number generators as well as the security vulnerabilities of blockchain technologies after the merge of quantum computers considering Shor's quantum factoring and Grover's quantum search algorithms. We then discuss the privacy preserving quantum-resistant blockchain systems via threshold signatures, ring signatures, and zero-knowledge proof systems i.e. ZK-SNARKs in quantum resistant blockchains. After emphasizing the difference between the quantum-resistant blockchain and quantum-safe blockchain we mention the security countermeasures to take against the possible quantumized attacks aiming these systems. We finalize our discussion with quantum blockchain, efficient quantum mining and necessary infrastructures for constructing such systems based on quantum computing. This review has the intention to be a bridge to fill the gap between quantum computing and one of its most prominent application realms: Finance. We provide the state-of-the-art results in the intersection of finance and quantum technology for both industrial practitioners and academicians.


  • Open Access

    Quantum Circuit Optimization of Arithmetic circuits using ZX Calculus

    by Aravind Joshi, Akshara Kairali, Renju Raju, Adithya Athreya, Reena Monica P, Sanjay Vishwakarma, Srinjoy Ganguly

    Quantum computing is an emerging technology in which quantum mechanical properties are suitably utilized to perform certain compute-intensive operations faster than classical computers. Quantum algorithms are designed as a combination of quantum circuits that each require a large number of quantum gates, which is a challenge considering the limited number of qubit resources available in quantum computing systems. Our work proposes a technique to optimize quantum arithmetic algorithms by reducing the hardware resources and the number of qubits based on ZX calculus. We have utilised ZX calculus rewrite rules for the optimization of fault-tolerant quantum multiplier circuits where we are able to achieve a significant reduction in the number of ancilla bits and T-gates as compared to the originally required numbers to achieve fault-tolerance. Our work is the first step in the series of arithmetic circuit optimization using graphical rewrite tools and it paves the way for advancing the optimization of various complex quantum circuits and establishing the potential for new applications of the same.