<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Qubit-Efficient on Tenu Tech Brief</title>
    <link>https://cluster-site.onrender.com/tags/qubit-efficient/</link>
    <description>Recent content in Qubit-Efficient on Tenu Tech Brief</description>
    <generator>Hugo -- 0.146.0</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 24 Feb 2026 06:05:49 +0000</lastBuildDate>
    <atom:link href="https://cluster-site.onrender.com/tags/qubit-efficient/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A Variational Qubit-Efficient MaxCut Heuristic Algorithm</title>
      <link>https://cluster-site.onrender.com/posts/a-variational-qubit-efficient-maxcut-heuristic-algorithm/</link>
      <pubDate>Tue, 24 Feb 2026 00:36:14 +0000</pubDate>
      <guid>https://cluster-site.onrender.com/posts/a-variational-qubit-efficient-maxcut-heuristic-algorithm/</guid>
      <description>• Abstract MaxCut is a key NP-hard combinatorial optimization problem. • Quantum computing offers methods to solve such problems potentially better than classical counterparts, wit</description>
    </item>
    <item>
      <title>A Variational Qubit-Efficient MaxCut Heuristic Algorithm</title>
      <link>https://cluster-site.onrender.com/posts/a-variational-qubit-efficient-maxcut-heuristic-algorithm/</link>
      <pubDate>Sun, 22 Feb 2026 00:36:34 +0000</pubDate>
      <guid>https://cluster-site.onrender.com/posts/a-variational-qubit-efficient-maxcut-heuristic-algorithm/</guid>
      <description>• Abstract MaxCut is a key NP-hard combinatorial optimization problem. • Quantum computing offers methods to solve such problems potentially better than classical counterparts, wit</description>
    </item>
  </channel>
</rss>
