<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom">
  <title>|QuantumFIT⟩</title>
  <subtitle>|QuantumFIT⟩ is the Quantum Computing Systems research group at the Faculty of Information Technology, Brno University of Technology, focused on quantum computing and quantum software engineering.</subtitle>
  <id>https://quantum.fit.vut.cz/</id>
  <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/" />
  <link rel="self" type="application/atom+xml" href="https://quantum.fit.vut.cz/feed.xml" />
  <updated>2025-11-10T00:00:00+01:00</updated>
  <author>
    <name>|QuantumFIT⟩</name>
  </author>
  <rights>|QuantumFIT⟩</rights>
  <entry>
    <title>Parameterized verification of quantum circuits accepted at POPL&apos;26</title>
    <id>https://quantum.fit.vut.cz/news/#2025-11-10-parameterized-verification-of-quantum-circuits-accepted-at-popl-26</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2025-11-10-parameterized-verification-of-quantum-circuits-accepted-at-popl-26" />
    <link rel="related" href="https://doi.org/10.1145/3776712" />
    <published>2025-11-10T00:00:00+01:00</published>
    <updated>2025-11-10T00:00:00+01:00</updated>
    <category term="publication" />
    <summary type="text">The paper “Parameterized Verification of Quantum Circuits” was accepted at POPL&apos;26 in Rennes, France, to appear in PACMPL 10 (POPL).</summary>
  </entry>
  <entry>
    <title>Quantum circuit verification in Communications of the ACM</title>
    <id>https://quantum.fit.vut.cz/news/#2025-05-29-quantum-circuit-verification-in-communications-of-the-acm</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2025-05-29-quantum-circuit-verification-in-communications-of-the-acm" />
    <link rel="related" href="https://doi.org/10.1145/3725728" />
    <published>2025-05-29T00:00:00+02:00</published>
    <updated>2025-05-29T00:00:00+02:00</updated>
    <category term="publication" />
    <summary type="text">The paper “An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits” appeared in the June 2025 issue of Communications of the ACM, volume 68 issue 6, pages 85–93.</summary>
  </entry>
  <entry>
    <title>Quantum program verification accepted at TACAS&apos;25</title>
    <id>https://quantum.fit.vut.cz/news/#2024-12-23-quantum-program-verification-accepted-at-tacas-25</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2024-12-23-quantum-program-verification-accepted-at-tacas-25" />
    <link rel="related" href="https://doi.org/10.1007/978-3-031-90660-2_5" />
    <published>2024-12-23T00:00:00+01:00</published>
    <updated>2024-12-23T00:00:00+01:00</updated>
    <category term="publication" />
    <summary type="text">The paper “AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs” was accepted at TACAS&apos;25 in Hamilton, Canada. It extends AutoQ from verifying quantum circuits to verifying quantum programs.</summary>
  </entry>
  <entry>
    <title>Sára Jobranová wins 8 z VUT with quantum circuit simulation</title>
    <id>https://quantum.fit.vut.cz/news/#2024-12-12-sára-jobranová-wins-8-z-vut-with-quantum-circuit-simulation</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2024-12-12-sára-jobranová-wins-8-z-vut-with-quantum-circuit-simulation" />
    <link rel="related" href="https://www.vut.cz/vut/aktuality-f19528/prehlidka-8-z-vut-patrila-kvantovym-pocitacum-robotice-a-designu-osvetleni-d270966" />
    <published>2024-12-12T00:00:00+01:00</published>
    <updated>2024-12-12T00:00:00+01:00</updated>
    <category term="award" />
    <summary type="text">Sára Jobranová won 8 z VUT 2024, the university-wide showcase of the best bachelor’s theses from across all VUT faculties. The jury judged her presentation on quantum circuit simulation the most impressive of the final evening, praising how clearly she put across a difficult topic.</summary>
  </entry>
  <entry>
    <title>Level-synchronized tree automata for quantum circuits accepted at POPL&apos;25</title>
    <id>https://quantum.fit.vut.cz/news/#2024-11-11-level-synchronized-tree-automata-for-quantum-circuits-accepted-at-popl-25</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2024-11-11-level-synchronized-tree-automata-for-quantum-circuits-accepted-at-popl-25" />
    <link rel="related" href="https://doi.org/10.1145/3704868" />
    <published>2024-11-11T00:00:00+01:00</published>
    <updated>2024-11-11T00:00:00+01:00</updated>
    <category term="publication" />
    <summary type="text">The paper “Verifying Quantum Circuits with Level-Synchronized Tree Automata” was accepted at POPL&apos;25 in Denver, Colorado, to appear in PACMPL 9 (POPL). The level-synchronized automata it introduces extend the class of quantum circuits AutoQ can verify.</summary>
  </entry>
  <entry>
    <title>Quantum circuit simulation accepted at ICCAD&apos;24</title>
    <id>https://quantum.fit.vut.cz/news/#2024-07-03-quantum-circuit-simulation-accepted-at-iccad-24</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2024-07-03-quantum-circuit-simulation-accepted-at-iccad-24" />
    <link rel="related" href="https://doi.org/10.1145/3676536.3676711" />
    <published>2024-07-03T00:00:00+02:00</published>
    <updated>2024-07-03T00:00:00+02:00</updated>
    <category term="publication" />
    <summary type="text">The paper “Accelerating Quantum Circuit Simulation with Symbolic Execution and Loop Summarization” was accepted at ICCAD&apos;24 in New Jersey. It introduces Medusa, which simulates quantum circuits symbolically and analyses a repeated block of gates once rather than unrolling it.</summary>
  </entry>
  <entry>
    <title>Quantum circuit verifier AutoQ accepted at CAV&apos;23</title>
    <id>https://quantum.fit.vut.cz/news/#2023-07-01-quantum-circuit-verifier-autoq-accepted-at-cav-23</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2023-07-01-quantum-circuit-verifier-autoq-accepted-at-cav-23" />
    <link rel="related" href="https://doi.org/10.1007/978-3-031-37709-9_7" />
    <published>2023-07-01T00:00:00+02:00</published>
    <updated>2023-07-01T00:00:00+02:00</updated>
    <category term="publication" />
    <summary type="text">The paper “AutoQ: An Automata-based Quantum Circuit Verifier” was accepted at CAV&apos;23 in Paris, France. AutoQ verifies quantum circuits and programs by representing whole sets of quantum states as tree automata, so a circuit can be checked against a specification without enumerating individual states.</summary>
  </entry>
  <entry>
    <title>Distinguished Paper Award at PLDI&apos;23 for quantum circuit verification</title>
    <id>https://quantum.fit.vut.cz/news/#2023-06-19-distinguished-paper-award-at-pldi-23-for-quantum-circuit-verification</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2023-06-19-distinguished-paper-award-at-pldi-23-for-quantum-circuit-verification" />
    <link rel="related" href="https://doi.org/10.1145/3591270" />
    <published>2023-06-19T00:00:00+02:00</published>
    <updated>2023-06-19T00:00:00+02:00</updated>
    <category term="award" />
    <summary type="text">The paper “An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits” was named a Distinguished Paper at PLDI&apos;23 in Orlando, Florida.</summary>
  </entry>
  <entry>
    <title>Quantum circuit verification paper accepted at PLDI&apos;23</title>
    <id>https://quantum.fit.vut.cz/news/#2023-02-27-quantum-circuit-verification-paper-accepted-at-pldi-23</id>
    <link rel="alternate" type="text/html" href="https://quantum.fit.vut.cz/news/#2023-02-27-quantum-circuit-verification-paper-accepted-at-pldi-23" />
    <link rel="related" href="https://doi.org/10.1145/3591270" />
    <published>2023-02-27T00:00:00+01:00</published>
    <updated>2023-02-27T00:00:00+01:00</updated>
    <category term="publication" />
    <summary type="text">The paper “An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits” was accepted at PLDI&apos;23, to appear in PACMPL 7 (PLDI). It checks a quantum circuit against a pre-/post-condition specification, or searches it for bugs, without ever enumerating individual quantum states.</summary>
  </entry>
</feed>
