Cited By
View all- Noll TGehnen CHermanns R(2024)Quantum Computing: From Weakest Preconditions to Voltage PulsesPrinciples of Verification: Cycling the Probabilistic Landscape10.1007/978-3-031-75783-9_9(201-229)Online publication date: 13-Nov-2024
Quantum Control Machine: The Limits of Control Flow in Quantum Programming
Article No.: 94, Pages 1 - 28
Abstract
Quantum algorithms for tasks such as factorization, search, and simulation rely on control flow such as branching and iteration that depends on the value of data in superposition. High-level programming abstractions for control flow, such as switches, loops, higher-order functions, and continuations, are ubiquitous in classical languages. By contrast, many quantum languages do not provide high-level abstractions for control flow in superposition, and instead require the use of hardware-level logic gates to implement such control flow.
The reason for this gap is that whereas a classical computer supports control flow abstractions using a program counter that can depend on data, the typical architecture of a quantum computer does not analogously provide a program counter that can depend on data in superposition. As a result, the complete set of control flow abstractions that can be correctly realized on a quantum computer has not yet been established.
In this work, we provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. First, we prove that even on a quantum computer whose program counter exists in superposition, one cannot correctly realize control flow in quantum algorithms by lifting the classical conditional jump instruction to work in superposition. This theorem denies the ability to directly lift general abstractions for control flow such as the λ-calculus from classical to quantum programming.
In response, we present the necessary and sufficient conditions for control flow to be correctly realizable on a quantum computer. We introduce the quantum control machine, an instruction set architecture featuring a conditional jump that is restricted to satisfy these conditions. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
Supplementary Material
Appendices of paper.
- Download
- 416.45 KB
References
[1]
Daniel S. Abrams and Seth Lloyd. 1997. Simulation of Many-Body Fermi Systems on a Universal Quantum Computer. Phys. Rev. Letters, 79 (1997), Sep, https://doi.org/10.1103/PhysRevLett.79.2586
[2]
Daniel S. Abrams and Seth Lloyd. 1999. Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors. Phys. Rev. Letters, 83, 24 (1999), Dec, https://doi.org/10.1103/PhysRevLett.83.5162
[3]
Dorit Aharonov, Andris Ambainis, Julia Kempe, and Umesh Vazirani. 2001. Quantum Walks on Graphs. In ACM Symposium on Theory of Computing. https://doi.org/10.1145/380752.380758
[4]
Thorsten Altenkirch and J. Grattage. 2005. A Functional Quantum Programming Language. In IEEE Symposium on Logic in Computer Science. https://doi.org/10.1109/LICS.2005.1
[5]
Andris Ambainis. 2004. Quantum walk algorithm for element distinctness. In IEEE Symposium on Foundations of Computer Science. https://doi.org/10.1109/FOCS.2004.54
[6]
Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous. 2001. One-Dimensional Quantum Walks. In ACM Symposium on Theory of Computing. https://doi.org/10.1145/380752.380757
[7]
Andris Ambainis, A. M. Childs, B. W. Reichardt, R. Špalek, and S. Zhang. 2010. Any AND-OR Formula of Size N Can Be Evaluated in Time N^1/2+o(1) on a Quantum Computer. SIAM J. Comput., 39, 6 (2010), https://doi.org/10.1137/080712167
[8]
Pablo Andrés-Martínez and Chris Heunen. 2022. Weakly measured while loops: peeking at quantum states. Quantum Science and Technology, 7, 2 (2022), Feb, https://doi.org/10.1088/2058-9565/ac47f1
[9]
Mateus Araújo, Adrien Feix, Fabio Costa, and Časlav Brukner. 2014. Quantum circuits cannot control unknown operations. New Journal of Physics, 16, 9 (2014), Sep, https://doi.org/10.1088/1367-2630/16/9/093026
[10]
Pablo Arrighi, Alejandro Díaz-Caro, and Benoît Valiron. 2017. The vectorial λ -calculus. Information and Computation, 254 (2017), https://doi.org/10.1016/j.ic.2017.04.001
[11]
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O’Connor, Michele Mosca, and Priyaa Varshinee Srinivasan. 2015. On the robustness of bucket brigade quantum RAM. New Journal of Physics, 17, 12 (2015), Dec, https://doi.org/10.1088/1367-2630/17/12/123010
[12]
Holger Bock Axelsen. 2011. Clean Translation of an Imperative Reversible Programming Language. In International Conference on Compiler Construction. https://doi.org/10.1007/978-3-642-19861-8_9
[13]
Holger Bock Axelsen, Robert Glück, and Tetsuo Yokoyama. 2007. Reversible Machine Code and Its Abstract Processor Architecture. In International Conference on Computer Science: Theory and Applications. https://doi.org/10.1007/978-3-540-74510-5_9
[14]
Ryan Babbush, Craig Gidney, Dominic W. Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven. 2018. Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity. Phys. Rev. X, 8, 4 (2018), Oct, https://doi.org/10.1103/PhysRevX.8.041015
[15]
Gilles Barthe, Sandrine Blazy, Benjamin Grégoire, Rémi Hutin, Vincent Laporte, David Pichardie, and Alix Trieu. 2019. Formal Verification of a Constant-Time Preserving C Compiler. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3371075
[16]
J. S. Bell. 1964. On the Einstein Podolsky Rosen paradox. Physics, 1 (1964), Nov, https://doi.org/10.1103/PhysicsPhysiqueFizika.1.195
[17]
Charles H. Bennett. 1973. Logical Reversibility of Computation. IBM Journal of Research and Development, 17, 6 (1973), https://doi.org/10.1147/rd.176.0525
[18]
Ethan Bernstein and Umesh Vazirani. 1997. Quantum Complexity Theory. SIAM J. Comput., 26, 5 (1997), https://doi.org/10.1137/S0097539796300921
[19]
Dominic W. Berry, Craig Gidney, Mario Motta, Jarrod R. McClean, and Ryan Babbush. 2019. Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization. Quantum, 3 (2019), Dec, https://doi.org/10.22331/q-2019-12-02-208
[20]
Benjamin Bichsel, Maximilian Baader, Timon Gehr, and Martin Vechev. 2020. Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/3385412.3386007
[21]
Kai-Wen Cheng and Chien-Cheng Tseng. 2002. Quantum full adder and subtractor. Electronics Letters, 38 (2002), https://doi.org/10.1049/el:20020949
[22]
Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su. 2018. Toward the first quantum simulation with quantum speedup. Proceedings of the National Academy of Sciences, 115, 38 (2018), Sep, https://doi.org/10.1073/pnas.1801723115
[23]
Andrew M. Childs, Ben W. Reichardt, Robert Spalek, and Shengyu Zhang. 2007. Every NAND formula of size N can be evaluated in time N^1/2+o(1) on a quantum computer. https://doi.org/10.48550/ARXIV.QUANT-PH/0703015 arxiv:0703015.
[24]
Andrew M. Childs and Nathan Wiebe. 2012. Hamiltonian Simulation Using Linear Combinations of Unitary Operations. Quantum Information and Computation, 12, 11&12 (2012), Nov, https://doi.org/10.26421/qic12.11-12
[25]
Giulio Chiribella, Giacomo Mauro D’Ariano, Paolo Perinotti, and Benoît Valiron. 2013. Quantum computations without definite causal structure. Phys. Rev. A, 88, 2 (2013), Aug, https://doi.org/10.1103/PhysRevA.88.022318
[26]
Seong-Min Cho, Aeyoung Kim, Dooho Choi, Byung-Soo Choi, and Seung-Hyun Seo. 2020. Quantum Modular Multiplication. IEEE Access, 8 (2020), https://doi.org/10.1109/ACCESS.2020.3039167
[27]
Alonzo Church. 1941. The Calculi of Lambda Conversion. https://doi.org/10.1515/9781400881932
[28]
Pierre Clairambault and Marc de Visme. 2019. Full Abstraction for the Quantum Lambda-Calculus. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3371131
[29]
Pierre Clairambault, Marc De Visme, and Glynn Winskel. 2019. Game Semantics for Quantum Programming. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3290345
[30]
David Deutsch. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society A, 400, 1818 (1985), https://doi.org/10.1098/rspa.1985.0070
[31]
Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky. 2006. On Reversible Combinatory Logic. In International Workshop on Developments in Computational Models. https://doi.org/10.1016/j.entcs.2005.09.018
[32]
Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, and Benoît Valiron. 2019. Realizability in the Unitary Sphere. In ACM/IEEE Symposium on Logic in Computer Science. https://doi.org/10.1109/LICS.2019.8785834
[33]
Thomas G. Draper. 2000. Addition on a Quantum Computer. arxiv:quant-ph/0008033.
[34]
Michael Frank. 1999. Reversibility for Efficient Computing. Ph. D. Dissertation. Massachusetts Institute of Technology. https://doi.org/1721.1/9464
[35]
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. 2008. Quantum Random Access Memory. Phys. Rev. Letters, 100, 16 (2008), Apr, https://doi.org/10.1103/PhysRevLett.100.160501
[36]
Oded Goldreich and Rafail Ostrovsky. 1996. Software Protection and Simulation on Oblivious RAMs. J. ACM, 43, 3 (1996), May, https://doi.org/10.1145/233551.233553
[37]
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, and Benoît Valiron. 2013. Quipper: A Scalable Quantum Programming Language. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/2491956.2462177
[38]
Lov K. Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. In ACM Symposium on Theory of Computing. https://doi.org/10.1145/237814.237866
[39]
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd. 2009. Quantum Algorithm for Linear Systems of Equations. Phys. Rev. Letters, 103, 15 (2009), Oct, https://doi.org/10.1103/PhysRevLett.103.150502
[40]
Ichiro Hasuo and Naohiko Hoshino. 2017. Semantics of higher-order quantum computation via geometry of interaction. In Games for Logic and Programming Languages Workshop. https://doi.org/10.1016/j.apal.2016.10.010
[41]
Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, and Michael Hicks. 2021. A Verified Optimizer for Quantum circuits. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3434318
[42]
Peter Hines. 2008. Machine semantics. Theoretical Computer Science, 409, 1 (2008), https://doi.org/10.1016/j.tcs.2008.07.015
[43]
Peter Hines. 2011. Can a Quantum Computer Run the von Neumann Architecture? In New Structures for Physics. https://doi.org/10.1007/978-3-642-12821-9_14
[44]
Md Saiful Islam, Muhammad Mahbubur Rahman, Zerina Begum, and Mohd Z Hafiz. 2009. Low cost quantum realization of reversible multiplier circuit. Information Technology Journal, 8, 2 (2009), https://doi.org/10.3923/itj.2009.208.213
[45]
Tien D. Kieu and Michael Danos. 1998. The halting problem for universal quantum computers. https://doi.org/10.48550/ARXIV.QUANT-PH/9811001 arxiv:9811001.
[46]
A. Yu. Kitaev. 1995. Quantum measurements and the Abelian Stabilizer Problem. https://doi.org/10.48550/arXiv.quant-ph/9511026 arxiv:quant-ph/9511026.
[47]
A. Yu. Kitaev. 1997. Quantum computations: algorithms and error correction. Russian Mathematical Surveys, 52, 6 (1997), Dec, https://doi.org/10.1070/RM1997V052N06ABEH002155
[48]
Morten Kjaergaard, Mollie E. Schwartz, Ami Greene, Gabriel O. Samach, Andreas Bengtsson, Michael O’Keeffe, Christopher M. McNally, Jochen Braumüller, David K. Kim, Philip Krantz, Milad Marvian, Alexander Melville, Bethany M. Niedzielski, Youngkyu Sung, Roni Winik, Jonilyn Yoder, Danna Rosenberg, Kevin Obenland, Seth Lloyd, Terry P. Orlando, Iman Marvian, Simon Gustavsson, and William D. Oliver. 2020. Programming a quantum computer with quantum instructions. https://doi.org/10.48550/ARXIV.2001.08838 arxiv:2001.08838.
[49]
Andre Kornell, Bert Lindenhovius, and Michael Mislove. 2021. Quantum CPOs. Electronic Proceedings in Theoretical Computer Science, 340 (2021), Sep, https://doi.org/10.4204/eptcs.340.9
[50]
Antonio A. Lagana, M. A. Lohe, and Lorenz von Smekal. 2009. Construction of a universal quantum computer. Phys. Rev. A, 79, 5 (2009), May, https://doi.org/10.1103/PhysRevA.79.052322
[51]
R. Landauer. 1961. Irreversibility and Heat Generation in the Computing Process. IBM Journal of Research and Development, 5, 3 (1961), https://doi.org/10.1147/rd.53.0183
[52]
Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, and Yuan Xie. 2020. Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https://doi.org/10.1145/3428218
[53]
Noah Linden and Sandu Popescu. 1998. The Halting Problem for Quantum Computers. https://doi.org/10.48550/ARXIV.QUANT-PH/9806054 arxiv:9806054.
[54]
Seth Lloyd, Silvano Garnerone, and Paolo Zanardi. 2014. Quantum algorithms for topological and geometric analysis of big data. Nature Communications, 7 (2014), Aug, https://doi.org/10.1038/ncomms10138
[55]
Guang Hao Low and Isaac L. Chuang. 2019. Hamiltonian Simulation by Qubitization. Quantum, 3 (2019), Jul, https://doi.org/10.22331/q-2019-07-12-163
[56]
Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer. 2018. Trading T-gates for dirty qubits in state preparation and unitary synthesis. https://doi.org/10.48550/arXiv.1812.00954 arxiv:1812.00954.
[57]
Octavio Malherbe, Philip Scott, and Peter Selinger. 2013. Presheaf Models of Quantum Computation: An Outline. In Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. https://doi.org/10.1007/978-3-642-38164-5_13
[58]
Olivia Di Matteo, Vlad Gheorghiu, and Michele Mosca. 2020. Fault-Tolerant Resource Estimation of Quantum Random-Access Memories. IEEE Transactions on Quantum Engineering, 1 (2020), https://doi.org/10.1109/tqe.2020.2965803
[59]
Florian Meier, Marcus Huber, Paul Erker, and Jake Xuereb. 2024. Autonomous Quantum Processing Unit: What does it take to construct a self-contained model for quantum computation? https://doi.org/10.48550/arXiv.2402.00111 arxiv:2402.00111.
[60]
John M. Myers. 1997. Can a Universal Quantum Computer Be Fully Quantum? Phys. Rev. Letters, 78, 9 (1997), Mar, https://doi.org/10.1103/PhysRevLett.78.1823
[61]
Moni Naor and Vanessa Teague. 2001. Anti-persistence: History independent data structures. In ACM Symposium on Theory of Computing. https://doi.org/10.1145/380752.380844
[62]
Michael A. Nielsen and Isaac L. Chuang. 1997. Programmable Quantum Gate Arrays. Phys. Rev. Letters, 79, 2 (1997), Jul, https://doi.org/10.1103/PhysRevLett.79.321
[63]
Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition. https://doi.org/10.1017/CBO9780511976667
[64]
Michele Pagani, Peter Selinger, and Benoît Valiron. 2014. Applying Quantitative Semantics to Higher-Order Quantum Computing. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/2535838.2535879
[65]
Abhinandan Pal and Anubhab Ghosh. 2022. Qiwi: A Beginner Friendly Quantum Language. In Companion Proceedings of the ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity. https://doi.org/10.1145/3563768.3563959
[66]
Alexandru Paler, Oumarou Oumarou, and Robert Basmadjian. 2020. Parallelizing the queries in a bucket-brigade quantum random access memory. Phys. Rev. A, 102, 3 (2020), Sep, https://doi.org/10.1103/PhysRevA.102.032608
[67]
A. Pati and S. Braunstein. 2000. Impossibility of deleting an unknown quantum state. Nature, 404 (2000), https://doi.org/10.1038/404130b0
[68]
Jennifer Paykin, Robert Rand, and Steve Zdancewic. 2017. QWIRE: A Core Language for Quantum Circuits. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3009837.3009894
[69]
Nicholas Pippenger and Michael J. Fischer. 1979. Relations Among Complexity Measures. J. ACM, 26, 2 (1979), Apr, https://doi.org/10.1145/322123.322138
[70]
John Proos and Christof Zalka. 2003. Shor’s Discrete Logarithm Quantum Algorithm for Elliptic Curves. Quantum Information and Computation, 3, 4 (2003), Jul.
[71]
Qiskit Developers. 2021. Qiskit: An Open-source Framework for Quantum Computing. https://doi.org/10.5281/zenodo.2573505
[72]
Mathys Rennela and Sam Staton. 2018. Classical Control and Quantum Circuits in Enriched Category Theory. In Conference on the Mathematical Foundations of Programming Semantics. https://doi.org/10.1016/j.entcs.2018.03.027
[73]
Mathys Rennela, Sam Staton, and Robert Furber. 2017. Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras. Electronic Proceedings in Theoretical Computer Science, 236 (2017), Jan, https://doi.org/10.4204/eptcs.236.11
[74]
Rich Rines and Isaac Chuang. 2018. High Performance Quantum Modular Multipliers. https://doi.org/10.48550/arXiv.1801.01081 arxiv:1801.01081.
[75]
Amr Sabry, Benoît Valiron, and Juliana Kaizer Vizzotto. 2018. From Symmetric Pattern-Matching to Quantum Control. In International Conference on Foundations of Software Science and Computation Structures. https://doi.org/10.1007/978-3-319-89366-2_19
[76]
Peter Selinger. 2004. Towards a quantum programming language. Mathematical Structures in Computer Science, 14 (2004), Aug, https://doi.org/10.1017/S0960129504004256
[77]
Sanjit A. Seshia and Jonathan Kotker. 2011. GameTime: A Toolkit for Timing Analysis of Software. In Tools and Algorithms for the Construction and Analysis of Systems. https://doi.org/10.1007/978-3-642-19835-9_34
[78]
Neil Shenvi, Julia Kempe, and K. Birgitta Whaley. 2003. Quantum random-walk search algorithm. Phys. Rev. A, 67, 5 (2003), May, https://doi.org/10.1103/PhysRevA.67.052307
[79]
Yaoyun Shi. 2003. Both Toffoli and Controlled-NOT need little help to do universal quantum computing. Quantum Information and Computation, 3, 1 (2003), Jan, https://doi.org/10.26421/QIC3.1-7
[80]
Peter W. Shor. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. Comput., 26, 5 (1997), Oct, https://doi.org/10.1137/S0097539795293172
[81]
Marcelo Sousa and Isil Dillig. 2016. Cartesian Hoare Logic for Verifying K-Safety Properties. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/2908080.2908092
[82]
Krysta Svore, Martin Roetteler, Alan Geller, Matthias Troyer, John Azariah, Christopher Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, and Andres Paz. 2018. Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. In Real World Domain Specific Languages Workshop. https://doi.org/10.1145/3183895.3183901
[83]
Michael Kirkedal Thomsen, Holger Bock Axelsen, and Robert Glück. 2012. A Reversible Processor Architecture and Its Reversible Logic Design. In Conference on Reversible Computation. https://doi.org/10.1007/978-3-642-29517-1_3
[84]
Dominique Unruh. 2019. Quantum Relational Hoare Logic. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3290346
[85]
André van Tonder. 2004. A Lambda Calculus for Quantum Computation. SIAM J. Comput., 33, 5 (2004), https://doi.org/10.1137/S0097539703432165
[86]
Carlin Vieri, M. Ammer, Michael Frank, Norman Margolus, and Tom Knight. 1998. A Fully Reversible Asymptotically Zero Energy Microprocessor. In Power-Driven Microarchitecture Workshop.
[87]
Finn Voichick, Liyi Li, Robert Rand, and Michael Hicks. 2023. Qunity: A Unified Language for Quantum and Classical Computing. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3571225
[88]
Dong-Sheng Wang. 2022. A prototype of quantum von Neumann architecture. Communications in Theoretical Physics, 74, 9 (2022), Aug, https://doi.org/10.1088/1572-9494/ac68d8
[89]
Nathan Wiebe, Daniel Braun, and Seth Lloyd. 2012. Quantum Algorithm for Data Fitting. Phys. Rev. Letters, 109, 5 (2012), Aug, https://doi.org/10.1103/PhysRevLett.109.050505
[90]
W. Wootters and W. Zurek. 1982. A single quantum cannot be cloned. Nature, 299 (1982), https://doi.org/10.1038/299802a0
[91]
Mingsheng Ying. 2014. Quantum Recursion and Second Quantisation. https://doi.org/10.48550/ARXIV.1405.4443 arxiv:1405.4443.
[92]
Mingsheng Ying and Yuan Feng. 2010. Quantum Loop Programs. Acta Informatica, https://doi.org/10.1007/s00236-010-0117-4
[93]
Mingsheng Ying, Nengkun Yu, and Yuan Feng. 2012. Defining Quantum Control Flow. https://doi.org/10.48550/ARXIV.1209.4379 arxiv:1209.4379.
[94]
Tetsuo Yokoyama, Holger Bock Axelsen, and Robert Glück. 2008. Reversible Flowchart Languages and the Structured Reversible Program Theorem. In Automata, Languages and Programming. https://doi.org/10.1007/978-3-540-70583-3_22
[95]
Nengkun Yu and Jens Palsberg. 2021. Quantum Abstract Interpretation. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/3410291
[96]
Charles Yuan and Michael Carbin. 2022. Tower: Data Structures in Quantum Superposition. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https://doi.org/10.1145/3563297
[97]
Charles Yuan, Christopher McNally, and Michael Carbin. 2022. Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs. In ACM SIGPLAN Symposium on Principles of Programming Languages. https://doi.org/10.1145/3498691
[98]
Charles Yuan, Agnes Villanyi, and Michael Carbin. 2024. Quantum Control Machine: The Limits of Control Flow in Quantum Programming. https://doi.org/10.5281/zenodo.10452601
Index Terms
- Quantum Control Machine: The Limits of Control Flow in Quantum Programming
Recommendations
Quantum correlation swapping
Quantum correlations (QCs), including quantum entanglement and those different, are important quantum resources and have attracted much attention recently. Quantum entanglement swapping as a kernel technique has already been applied to quantum repeaters ...
Can quantum discord increase in a quantum communication task?
Quantum teleportation of an unknown quantum state is one of the few communication tasks which has no classical counterpart. Usually the aim of teleportation is to send an unknown quantum state to a receiver. But is it possible in some way that the ...
Construction of general quantum channel for quantum teleportation
We investigate teleportation and controlled teleportation of an arbitrary $$N$$ -qubit state by using a multipartite entanglement channel. By establishing one-to-one correspondence between an $$N$$ -qubit quantum state and a high-dimension quantum state, we ...
Comments
Information & Contributors
Information
Published In
April 2024
1492 pages
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 April 2024
Published in PACMPL Volume 8, Issue OOPSLA1
Check for updates
Badges
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 603Total Downloads
- Downloads (Last 12 months)603
- Downloads (Last 6 weeks)104
Reflects downloads up to 25 Feb 2025
Other Metrics
Citations
Cited By
View all- Noll TGehnen CHermanns R(2024)Quantum Computing: From Weakest Preconditions to Voltage PulsesPrinciples of Verification: Cycling the Probabilistic Landscape10.1007/978-3-031-75783-9_9(201-229)Online publication date: 13-Nov-2024
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in