Author: polarnova

  • 在黄昏与影子之间:《大师与玛格丽特》的魔幻现实

    In the pantheon of twentieth-century literature, few novels combine the sardonic gaze of satire, the vertigo of magical realism, and the aching lyricism of Romanticism as audaciously as Mikhail Bulgakov’s The Master and Margarita. Set against the granite façade of Stalinist Moscow yet soaring into biblical antiquity and metaphysical twilight, the book refuses to let […]

  • Can all NP problems be efficiently solved in quantum polynomial time?

    The Bennett–Bernstein–Brassard–Vazirani 1997 (BBBV97) paper, titled “Strengths and Weaknesses of Quantum Computing”, has had a profound and enduring impact on both theoretical computer science and cryptography. By clarifying the limitations of quantum advantage, BBBV97 indirectly influenced cryptographers to recognize that not all classical problems are vulnerable to quantum attacks. Coupled with Shor’s algorithm showing polynomial-speed […]

  • Quantum Information Processing

    “Central to many recent quantum algorithms is the ability to reduce high-dimensional operators to SU(2) building blocks, manipulate them with phase rotations, and then lift the resulting polynomial back to the original space.” 1 Prelude: Why these three ideas? Cosine–sine decomposition (CSD) gives an explicit, numerically stable way to factor a unitary (or a tall […]

  • Prologue – 卷首语

    “A writer is someone for whom writing is more difficult than it is for other people.” — Thomas Mann polarnova.xyz – This domain has quite a history. Back in high school, when everyone in the informatics‑competition crowd was spinning up blogs for problem‑solving notes and assorted shenanigans, I followed suit. AI was still a distant […]