Treatment of sound on quantum computers

内存受限量子计算机的声证

Sound certification of memory-bounded quantum computers

本文提出一种无需可信态制备的量子门认证方法，通过预设的小规模计算问题验证量子服务器的正确性，证明其在多种门集下的可靠性，并通过实验验证了其鲁棒性和效率。

The New AI: General & Sound & Relevant for Physics

Most traditional artificial intelligence (AI) systems of the past 50 years are either very limited, or based on heuristics, or both. The new millennium, however, has brought substantial progress in the field of theoretically optimal and practically feasible algorithms for prediction, search, inductive inference based on Occam's razor, problem solving, decision making, and reinforcement learning in environments of a very general type. Since inductive inference is at the heart of all inductive sciences, some of the results are relevant not only for AI and computer science but also for physics, p…

关于量子声音景观与音乐的注记

Notes on Quantum Soundscapes and Music

本文探讨了利用量子系统数据生成声音景观与音乐，以测试宏观现实破坏的方法及其实验结果。

Quanta in sound, the sound of quanta: a voice-informed quantum theoretical perspective on sound

Humans have a privileged, embodied way to explore the world of sounds, through vocal imitation. The Quantum Vocal Theory of Sounds (QVTS) starts from the assumption that any sound can be expressed and described as the evolution of a superposition of vocal states, i.e., phonation, turbulence, and supraglottal myoelastic vibrations. The postulates of quantum mechanics, with the notions of observable, measurement, and time evolution of state, provide a model that can be used for sound processing, in both directions of analysis and synthesis. QVTS can give a quantum-theoretic explanation to some a…

量子计算机上偏微分方程变分量子模拟的边界处理

Boundary Treatment for Variational Quantum Simulations of Partial Differential Equations on Quantum Computers

本文提出一种适用于NISQ时代的变分量子算法，通过将偏微分方程转化为最优控制问题并采用校正技术处理边界条件，实现了高精度与多对数门复杂度缩放。

Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs

Quantum programming languages enable developers to implement algorithms for quantum computers that promise computational breakthroughs in classically intractable tasks. Programming quantum computers requires awareness of entanglement, the phenomenon in which measurement outcomes of qubits are correlated. Entanglement can determine the correctness of algorithms and suitability of programming patterns. In this work, we formalize purity as a central tool for automating reasoning about entanglement in quantum programs. A pure expression is one whose evaluation is unaffected by the measurement outc…