Hybrid Quantum-Classical Unit Commitment

Adapting Quantum Approximation Optimization Algorithm (QAOA) for Unit Commitment

In the present Noisy Intermediate-Scale Quantum (NISQ), hybrid algorithms that leverage classical resources to reduce quantum costs are particularly appealing. We formulate and apply such a hybrid quantum-classical algorithm to a power system optimization problem called Unit Commitment, which aims to satisfy a target power load at minimal cost. Our algorithm extends the Quantum Approximation Optimization Algorithm (QAOA) with a classical minimizer in order to support mixed binary optimization. Using Qiskit, we simulate results for sample systems to validate the effectiveness of our approach. W…

一种面向高约束机组组合问题的混合经典-量子方法

A hybrid classical-quantum approach to highly constrained Unit Commitment problems

针对NP难的机组组合问题，提出一种混合量子-经典算法，将问题分解为QUBO和二次优化，用QAOA选机组、经典方法定出力，含旋转备用约束并采用暖启动，单层QAOA解与经典解误差在5.1%内且保持多项式时间。

通过泡利相关性编码扩展量子优化用于单位调度

Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding

本文提出了一种混合量子-经典方法，用于具有时间依赖约束的单位调度问题，通过泡利相关性编码以更少的量子比特处理大规模调度问题，实现高效可行的调度方案。

Quantum Bit Commitment in a Noisy Channel

Under rather general assumptions about the properties of a noisy quantum channel, a first quantum protocol is proposed which allows to implement the secret bit commitment with the probability arbitrarily close to unity.

Quantum Bit Commitment can be Unconditionally Secure

It is generally believed that unconditionally secure quantum bit commitment (QBC) is proven impossible by a "no-go theorem". We point out that the theorem only establishes the existence of a cheating unitary transformation in any QBC scheme secure against the receiver, but this fact alone is not sufficient to rule out unconditionally secure QBC as a matter of principle, because there exists no proof that the cheating unitary transformation must be known to the cheater in all possible cases. In this work, we show how to circumvent the "no-go theorem" and prove that unconditionally secure QBC is…

Quantum Bit Commitment with a Composite Evidence

Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a monolithic quantum system. We argue that more general evidence structures, allowing for a composite, hybrid (classical-quantum) evidence, conduce to improved security. In particular, we present and prove the security of the following protocol: Bob sends Alice an anonymous state. She inscribes her commitment $b$ by measuring part of it in the + (for $b = 0$) or $\…