LinguaQuanta: Towards a Quantum Transpiler Between OpenQASM and Quipper (Extended)
- URL: http://arxiv.org/abs/2404.08147v2
- Date: Thu, 16 May 2024 01:58:03 GMT
- Title: LinguaQuanta: Towards a Quantum Transpiler Between OpenQASM and Quipper (Extended)
- Authors: Scott Wesley,
- Abstract summary: We provide categorical specifications for quantum transpilers, which aim to encapsulate the core principles of the UNIX philosophy.
We then identify quantum circuit decompositions which we expect to be useful in quantum transpilation.
We discuss challenges faced during the implementation of LinguaQuanta, such as ancilla management and stability under round translation.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: As quantum computing evolves, many important questions emerge, such as how best to represent quantum programs, and how to promote interoperability between quantum program analysis tools. These questions arise naturally in the design of quantum transpilers, which translate between quantum programming languages. In this paper, we take a step towards answering these questions by identifying challenges and best practices in quantum transpiler design. We base these recommendations on our experience designing LinguaQuanta, a quantum transpiler between Quipper and OpenQASM. First, we provide categorical specifications for quantum transpilers, which aim to encapsulate the core principles of the UNIX philosophy. We then identify quantum circuit decompositions which we expect to be useful in quantum transpilation. With these foundations in place, we then discuss challenges faced during the implementation of LinguaQuanta, such as ancilla management and stability under round translation. To show that LinguaQuanta works in practice, a short tutorial is given for the example of quantum phase estimation. We conclude with recommendations for the future of LinguaQuanta, and for quantum software development tools more broadly.
Related papers
- Parameterized quantum comb and simpler circuits for reversing unknown
qubit-unitary operations [8.630679964089696]
PQComb is a framework leveraging parameterized quantum circuits to explore the capabilities of quantum combs.
We develop a protocol for unknown qubit unitary inversion that reduces the ancilla qubit overhead from 6 to 3.
Our results pave the way for broader PQComb applications in quantum computing and quantum information.
arXiv Detail & Related papers (2024-03-06T14:53:24Z) - A Case for Synthesis of Recursive Quantum Unitary Programs [9.287571320531457]
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming.
We present Q Synth, the first quantum program synthesis framework, including a new inductive quantum programming language.
Q Synth successfully synthesizes ten quantum unitary programs including quantum adder circuits, quantum eigenvalue inversion circuits and Quantum Fourier Transformation.
arXiv Detail & Related papers (2023-11-20T03:01:36Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Assessing requirements to scale to practical quantum advantage [56.22441723982983]
We develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required for large-scale quantum applications.
We assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage.
A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack.
arXiv Detail & Related papers (2022-11-14T18:50:27Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
Quantum generative learning models (QGLMs) may surpass their classical counterparts.
We review the current progress of QGLMs from the perspective of machine learning.
We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
arXiv Detail & Related papers (2022-06-07T07:32:57Z) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Foundations for Near-Term Quantum Natural Language Processing [0.17205106391379021]
We provide conceptual and mathematical foundations for near-term quantum natural language processing (QNLP)
We recall how the quantum model for natural language that we employ canonically combines linguistic meanings with rich linguistic structure.
We provide references for supporting empirical evidence and formal statements concerning mathematical generality.
arXiv Detail & Related papers (2020-12-07T14:49:33Z) - Compiling quantamorphisms for the IBM Q Experience [0.0]
This paper contributes to extending the laws of classical program algebra to quantum programming.
It aims at building correct-by-construction quantum circuits to be deployed on quantum devices such as those available at the IBM Q Experience.
arXiv Detail & Related papers (2020-10-21T13:32:24Z) - On the Principles of Differentiable Quantum Programming Languages [13.070557640180004]
Variational Quantum Circuits (VQCs) are predicted to be one of the most important near-term quantum applications.
We propose the first formalization of auto-differentiation techniques for quantum circuits.
arXiv Detail & Related papers (2020-04-02T16:46:13Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.