research-article

A quantum interpretation of bunched logic & quantum separation logic

Authors:

Mingsheng Ying,

Nengkun YuAuthors Info & Claims

LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science

Article No.: 75, Pages 1 - 14

https://doi.org/10.1109/LICS52264.2021.9470673

Published: 24 November 2021 Publication History

Abstract

We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states. In our model, the separating conjunction of BI describes separable quantum states. We develop a program logic where pre- and post-conditions are BI formulas describing quantum states---the program logic can be seen as a counterpart of separation logic for imperative quantum programs. We exercise the logic for proving the security of quantum one-time pad and secret sharing, and we show how the program logic can be used to discover a flaw in Google Cirq's tutorial on the Variational Quantum Algorithm (VQA).

References

[1]

P. W. O'Hearn and D. J. Pym, "The logic of bunched implications," The Bulletin of Symbolic Logic, vol. 5, no. 2, pp. 215--244, 1999. [Online].

[2]

D. J. Pym, The semantics and proof theory of the logic of bunched implications, ser. Applied Logic Series. Kluwer Academic Publishers, 2002, vol. 26.

[3]

D. J. Pym, P. W. O'Hearn, and H. Yang, "Possible worlds and resources: the semantics of BI," Theoretical Computer Science, vol. 315, no. 1, pp. 257--305, 2004, mathematical Foundations of Programming Semantics. [Online].

Digital Library

[4]

J. Reynolds, "Separation logic: a logic for shared mutable data structures," in Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002, pp. 55--74. [Online].

Digital Library

[5]

P. O'Hearn, J. Reynolds, and H. Yang, "Local reasoning about programs that alter data structures," in Computer Science Logic, L. Fribourg, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001, pp. 1--19. [Online].

Digital Library

[6]

S. S. Ishtiaq and P. W. O'Hearn, "BI as an assertion language for mutable data structures," in Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ser. POPL '01. New York, NY, USA: ACM, 2001, pp. 14--26. [Online].

Digital Library

[7]

P. W. O'Hearn, "Resources, concurrency, and local reasoning," Theoretical Computer Science, vol. 375, no. 1, pp. 271--307, 2007, festschrift for John C. Reynolds's 70th birthday. [Online].

Digital Library

[8]

S. Brookes, "A semantics for concurrent separation logic," Theoretical Computer Science, vol. 375, no. 1, pp. 227--270, 2007, festschrift for John C. Reynolds's 70th birthday. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S0304397506009248

Digital Library

[9]

G. Barthe, J. Hsu, and K. Liao, "A probabilistic separation logic," Proc. ACM Program. Lang., vol. 4, no. POPL, Dec. 2019. [Online].

Digital Library

[10]

B. Coecke, T. Fritz, and R. W. Spekkens, "A mathematical theory of resources," Inf. Comput., vol. 250, pp. 59--86, 2016. [Online].

Digital Library

[11]

S. R. Docherty, "Bunched logics: a uniform approach," Ph.D. dissertation, UCL (University College London), 2019. [Online]. Available: https://discovery.ucl.ac.uk/id/eprint/10073115/

[12]

J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, "Quantum machine learning," Nature, vol. 549, no. 7671, pp. 195--202, Sep 2017. [Online].

[13]

M. Broughton, G. Verdon, T. McCourt, A. J. Martinez, J. H. Yoo, S. V. Isakov, P. Massey, M. Y. Niu, R. Halavati, E. Peters, M. Leib, A. Skolik, M. Streif, D. V. Dollen, J. R. McClean, S. Boixo, D. Bacon, A. K. Ho, H. Neven, and M. Mohseni, "TensorFlow Quantum: A software framework for quantum machine learning," 2020. [Online]. Available: https://arxiv.org/abs/2003.02989

[14]

A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O'Brien, "A variational eigenvalue solver on a photonic quantum processor," Nature Communications, vol. 5, no. 1, p. 4213, Jul 2014. [Online].

[15]

J. R. McClean, J. Romero, R. Babbush, and A. Aspuru-Guzik, "The theory of variational hybrid quantum-classical algorithms," New Journal of Physics, vol. 18, no. 2, p. 023023, feb 2016. [Online].

[16]

M. Ying, "Floyd-Hoare logic for quantum programs," ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 6, pp. 19:1--19:49, 2011. [Online].

Digital Library

[17]

L. Zhou, N. Yu, and M. Ying, "An applied quantum Hoare logic," in Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, ser. PLDI 2019. New York, NY, USA: Association for Computing Machinery, 2019, p. 1149--1162. [Online].

Digital Library

[18]

S. Z. Robert Rand, Jennifer Paykin, "QWIRE practice: Formal verification of quantum circuits in Coq," in 14th International Conference on Quantum Physics and Logic 2017, ser. QPL '17, may 2017. [Online]. Available: https://qpl.science.ru.nl/papers/QPL2017paper45.pdf

[19]

K. Hietala, R. Rand, S.-H. Hung, X. Wu, and M. Hicks, "A verified optimizer for quantum circuits," Proc. ACM Program. Lang., vol. 5, no. POPL, Jan. 2021. [Online].

Digital Library

[20]

K. Hietala, R. Rand, S.-H. Hung, L. Li, and M. Hicks, "Proving quantum programs correct," 2020. [Online]. Available: https://arxiv.org/abs/2010.01240

[21]

J. C. Reynolds, "An introduction to separation logic (preliminary draft)," Course notes, October, 2008. [Online]. Available: http://www.cs.cmu.edu/afs/cs.cmu.edu/user/jcr/www/copenhagen08.pdf

[22]

M. A. Nielsen and I. Chuang, Quantum computation and quantum information. Cambridge University Press, 2002.

Digital Library

[23]

M. Ying, L. Zhou, and Y. Li, "Reasoning about parallel quantum programs," 2018. [Online]. Available: https://arxiv.org/abs/1810.11334

[24]

J. Liu, B. Zhan, S. Wang, S. Ying, T. Liu, Y. Li, M. Ying, and N. Zhan, "Formal verification of quantum algorithms using quantum Hoare logic," in Computer Aided Verification, I. Dillig and S. Tasiran, Eds. Cham: Springer International Publishing, 2019, pp. 187--207. [Online].

[25]

A. Bordg, H. Lachnitt, and Y. He, "Certified quantum computation in Isabelle/HOL," Journal of Automated Reasoning, Dec 2020. [Online].

[26]

The Cirq Developers, "quantumlib/Cirq: A Python framework for creating, editing, and invoking noisy intermediate scale quantum (NISQ) circuits," 2018. [Online]. Available: https://github.com/quantumlib/Cirq

[27]

P. O. Boykin and V. Roychowdhury, "Optimal encryption of quantum bits," Phys. Rev. A, vol. 67, p. 042317, Apr 2003. [Online].

[28]

M. Mosca, A. Tapp, and R. de Wolf, "Private quantum channels and the cost of randomizing quantum information," arXiv preprint quant-ph/0003101, 2000. [Online]. Available: https://arxiv.org/abs/quant-ph/0003101

[29]

R. Cleve, D. Gottesman, and H.-K. Lo, "How to share a quantum secret," Phys. Rev. Lett., vol. 83, pp. 648--651, Jul 1999. [Online].

[30]

M. Hillery, V. Bužek, and A. Berthiaume, "Quantum secret sharing," Phys. Rev. A, vol. 59, pp. 1829--1834, Mar 1999. [Online].

[31]

G. Barthe, J. Hsu, M. Ying, N. Yu, and L. Zhou, "Relational proofs for quantum programs," Proc. ACM Program. Lang., vol. 4, no. POPL, Dec. 2019. [Online].

Digital Library

[32]

P. Selinger, "Towards a quantum programming language," Mathematical Structures in Computer Science, vol. 14, no. 4, pp. 527--586, 2004. [Online].

Digital Library

[33]

M. Ying, Foundations of Quantum Programming. Morgan Kaufmann, 2016.

Digital Library

[34]

L. Zhou, G. Barthe, J. Hsu, M. Ying, and N. Yu, "A quantum interpretation of bunched logic for quantum separation logic," 2021. [Online]. Available: https://arxiv.org/abs/2102.00329

Digital Library

[35]

M. Ying, R. Duan, Y. Feng, and Z. Ji, "Predicate transformer semantics of quantum programs," Semantic Techniques in Quantum Computation, no. 8, pp. 311--360, 2010.

[36]

D. Unruh, "Quantum relational Hoare logic," Proc. ACM Program. Lang., vol. 3, no. POPL, Jan. 2019. [Online].

Digital Library

[37]

N. Yu and J. Palsberg, "Quantum abstract interpretation," in Proceedings of the 42th ACM SIGPLAN Conference on Programming Language Design and Implementation, ser. PLDI 2021. New York, NY, USA: Association for Computing Machinery, 2021.

Digital Library

[38]

D. Unruh, "Quantum Hoare logic with ghost variables," in 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2019, pp. 1--13. [Online].

Digital Library

[39]

J. Preskill, "Quantum computing in the NISQ era and beyond," Quantum, vol. 2, p. 79, Aug. 2018. [Online].

[40]

G. R. Blakley, "Safeguarding cryptographic keys," in Managing Requirements Knowledge, International Workshop on. Los Alamitos, CA, USA: IEEE Computer Society, jun 1979, p. 313. [Online].

[41]

A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, p. 612--613, Nov. 1979. [Online].

Digital Library

[42]

A. Karlsson, M. Koashi, and N. Imoto, "Quantum entanglement for secret sharing and secret splitting," Phys. Rev. A, vol. 59, pp. 162--168, Jan 1999. [Online].

[43]

B. Heim, M. Soeken, S. Marshall, C. Granade, M. Roetteler, A. Geller, M. Troyer, and K. Svore, "Quantum programming languages," Nature Reviews Physics, vol. 2, no. 12, pp. 709--722, Dec 2020. [Online].

[44]

D. Akatov, "The logic of quantum program verification," Master's thesis, Oxford University Computing Laboratory, 2005. [Online]. Available: http://www.academia.edu/download/7563948/thesis-1.1.ps

[45]

E. D'hondt and P. Panangaden, "Quantum weakest preconditions," Mathematical Structures in Computer Science, vol. 16, no. 3, pp. 429--451, 2006. [Online].

Digital Library

[46]

A. Baltag and S. Smets, "The logic of quantum programs," in Proceedings of the 2nd International Workshop on Quantum Programming Languages (QPL 2004), P. Selinger, Ed., 2004, pp. 39--56. [Online]. Available: https://www.mathstat.dal.ca/~selinger/qpl2004/PDFS/04Baltag-Smets.pdf

[47]

A. Baltag and S. Smets, "LQP: the dynamic logic of quantum information," Mathematical Structures in Computer Science, vol. 16, no. 3, pp. 491--525, 2006. [Online].

Digital Library

[48]

O. Brunet and P. Jorrand, "Dynamic quantum logic for quantum programs," International Journal of Quantum Information, vol. 02, no. 01, pp. 45--54, 2004. [Online].

[49]

R. Chadha, P. Mateus, and A. Sernadas, "Reasoning about imperative quantum programs," Electronic Notes in Theoretical Computer Science, vol. 158, pp. 19--39, 2006. [Online].

Digital Library

[50]

Y. Kakutani, "A logic for formal verification of quantum programs," in Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy (ASIAN 2009), A. Datta, Ed., Springer. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 79--93. [Online].

Digital Library

[51]

R. Rand, "Verification logics for quantum programs," 2016. [Online]. Available: http://www.cs.umd.edu/~rrand/wpe.pdf

[52]

Y. Feng, R. Duan, Z. Ji, and M. Ying, "Proof rules for the correctness of quantum programs," Theoretical Computer Science, vol. 386, no. 1--2, pp. 151--166, 2007. [Online].

Digital Library

[53]

N. Yu, "Quantum temporal logic," 2019. [Online]. Available: https://arxiv.org/abs/1908.00158

[54]

Y. Li and D. Unruh, "Quantum relational Hoare logic with expectations," 2019.

Digital Library

[55]

K. Singhal and J. Reppy, "Quantum Hoare type theory: Extended abstract," in 17th International Conference on Quantum Physics and Logic 2020, ser. QPL '20, may 2020. [Online]. Available: http://ks.cs.uchicago.edu/publication/qhtt/

[56]

K. Singhal, "Quantum Hoare type theory," 2020. [Online]. Available: https://arxiv.org/abs/2012.02154

[57]

A. Vanrietvelde, H. Kristjánsson, and J. Barrett, "Routed quantum circuits," 2020. [Online]. Available: https://arxiv.org/abs/2011.08120

[58]

T. Altenkirch and J. Grattage, "A functional quantum programming language," in Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05). IEEE, 2005, pp. 249--258. [Online].

Digital Library

[59]

M. Ying, N. Yu, and Y. Feng, "Defining quantum control flow," 2012. [Online]. Available: https://arxiv.org/abs/1209.4379

[60]

M. Ying, N. Yu, and Y. Feng, "Alternation in quantum programming: From superposition of data to superposition of programs," 2014. [Online]. Available: https://arxiv.org/abs/1402.5172

[61]

C. Bădescu and P. Panangaden, "Quantum alternation: Prospects and problems," in Proceedings of the 12th International Workshop on Quantum Physics and Logic, Oxford, U.K., July 15--17, 2015, ser. Electronic Proceedings in Theoretical Computer Science, C. Heunen, P. Selinger, and J. Vicary, Eds., vol. 195. Open Publishing Association, 2015, pp. 33--42. [Online].

[62]

Z. Gavorová, M. Seidel, and Y. Touati, "Topological obstructions to implementing controlled unknown unitaries," 2020. [Online]. Available: https://arxiv.org/abs/2011.10031

[63]

P. Andrés-Martínez and C. Heunen, "Weakly measured while loops: peeking at quantum states," 2021. [Online]. Available: https://arxiv.org/abs/2009.08832

[64]

M. Horodecki and J. Oppenheim, "(Quantumness in the context of) Resource theories," International Journal of Modern Physics B, vol. 27, no. 01n03, p. 1345019, 2013. [Online].

[65]

M. B. Plenio and S. S. Virmani, An Introduction to Entanglement Theory. Cham: Springer International Publishing, 2014, pp. 173--209. [Online].

Digital Library

[66]

V. Veitch, S. A. H. Mousavian, D. Gottesman, and J. Emerson, "The resource theory of stabilizer quantum computation," New Journal of Physics, vol. 16, no. 1, p. 013009, jan 2014. [Online].

[67]

T. Fritz, "Resource convertibility and ordered commutative monoids," Mathematical Structures in Computer Science, vol. 27, no. 6, p. 850--938, 2017. [Online].

Cited By

Li JAytac JJohnson-Freyd PAhmed AHoltzen SSobocinski PLago UEsparza J(2024)A Nominal Approach to Probabilistic Separation LogicProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662135(1-14)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662135
Yan PJiang HYu N(2024)Approximate Relational Reasoning for Quantum ProgramsComputer Aided Verification10.1007/978-3-031-65633-0_22(495-519)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65633-0_22
Li JAhmed AHoltzen S(2023)Lilac: A Modal Separation Logic for Conditional ProbabilityProceedings of the ACM on Programming Languages10.1145/35912267:PLDI(148-171)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591226
Show More Cited By

Index Terms

A quantum interpretation of bunched logic & quantum separation logic

Index terms have been assigned to the content through auto-classification.

Recommendations

Floyd--hoare logic for quantum programs

Floyd--Hoare logic is a foundation of axiomatic semantics of classical programs, and it provides effective proof techniques for reasoning about correctness of classical programs. To offer similar techniques for quantum program verification and to build ...
On Bunched Predicate Logic
LICS '99: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

We present the logic of bunched implications, BI,in which a multiplicative (or linear) and an additive (or intuitionistic) implication live side-by-side. The propositional version of BI arises from an analysis of the proof-theoretic relationship between ...
LQP: the dynamic logic of quantum information

The main contribution of this paper is the introduction of a dynamic logic formalism for reasoning about information flow in composite quantum systems. This builds on our previous work on a complete quantum dynamic logic for single systems. Here we ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

LICS '21: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science

June 2021

1227 pages

ISBN:9781665448956

Conference Chair:
Daniele Gorla
Università di Roma "La Sapienza"

Sponsors

SIGLOG: ACM Special Interest Group on Logic and Computation

In-Cooperation

EACSL: European Association for Computer Science Logic
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 November 2021

Check for updates

Qualifiers

Research-article

Conference

LICS '21

Sponsor:

SIGLOG

LICS '21: 36th Annual ACM/IEEE Symposium on Logic in Computer Science

June 29 - July 2, 2021

Rome, Italy

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
42
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)2

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li JAytac JJohnson-Freyd PAhmed AHoltzen SSobocinski PLago UEsparza J(2024)A Nominal Approach to Probabilistic Separation LogicProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662135(1-14)Online publication date: 8-Jul-2024
https://dl.acm.org/doi/10.1145/3661814.3662135
Yan PJiang HYu N(2024)Approximate Relational Reasoning for Quantum ProgramsComputer Aided Verification10.1007/978-3-031-65633-0_22(495-519)Online publication date: 24-Jul-2024
https://dl.acm.org/doi/10.1007/978-3-031-65633-0_22
Li JAhmed AHoltzen S(2023)Lilac: A Modal Separation Logic for Conditional ProbabilityProceedings of the ACM on Programming Languages10.1145/35912267:PLDI(148-171)Online publication date: 6-Jun-2023
https://dl.acm.org/doi/10.1145/3591226
Zhou LBarthe GStrub PLiu JYing M(2023)CoqQ: Foundational Verification of Quantum ProgramsProceedings of the ACM on Programming Languages10.1145/35712227:POPL(833-865)Online publication date: 11-Jan-2023
https://dl.acm.org/doi/10.1145/3571222
Yan PJiang HYu N(2022)On incorrectness logic for Quantum programsProceedings of the ACM on Programming Languages10.1145/35273166:OOPSLA1(1-28)Online publication date: 29-Apr-2022
https://dl.acm.org/doi/10.1145/3527316
Yuan CMcNally CCarbin M(2022)Twist: sound reasoning for purity and entanglement in Quantum programsProceedings of the ACM on Programming Languages10.1145/34986916:POPL(1-32)Online publication date: 12-Jan-2022
https://dl.acm.org/doi/10.1145/3498691

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents