お知らせ • May 05
MicroCloud Hologram Inc. Launches Efficient Deterministic Quantum State Preparation Algorithm Based On Decision Diagrams
MicroCloud Hologram Inc. announced the launch of its latest core technology — the Efficient Deterministic Quantum State Preparation Algorithm Based on Decision Diagrams. This original algorithm, for the first time, systematically applies the highly mature Decision Diagram data structure from classical computing to the precise representation and circuit synthesis of quantum states. By cleverly exploiting the path reduction and sharing characteristics of decision diagrams, it establishes a strict linear relationship between the number of CNOT gates in the preparation circuit and the number of reduced paths in the decision diagram. This achieves significant resource compression for highly structured quantum states, markedly surpassing existing mainstream methods, and injects strong momentum into the foundational operation layer of practical quantum computing. As a general-purpose data structure, the decision diagram was originally born in the field of representation and analysis of classical Boolean functions. It is essentially a directed acyclic graph that compactly encodes the truth table of a function through variable nodes, 0/1 branch edges, and terminal nodes, avoiding exponential storage explosion. In its simplified or reduced form, the decision diagram achieves extremely high compression rates by merging identical subgraphs, eliminating redundant nodes, and sharing paths. MicroCloud Hologram Inc. extends this classical tool to the quantum domain and proposes a class of quantum states that can be efficiently represented using reduced Algebraic Decision Diagrams (ADD). Specifically, for a quantum state |?? = ? a_s |s?, where s is an n-bit basis state string, the non-zero amplitudes a_s correspond to paths in the decision diagram. Each internal node represents a qubit variable, solid edges represent the 1-branch, dashed edges represent the 0-branch, and terminal nodes store the normalized amplitude values. Through reduction rules — merging identical terminals, eliminating single-child nodes, and sharing identical subgraphs — a state that might originally have m non-zero amplitudes is compressed into a decision diagram with only k paths, where k is often much smaller than m or even 2^n. This representation captures the sparsity and repetitive patterns of the quantum state, such as certain subsets of basis states sharing the same amplitude or substructure, thereby providing a roadmap for subsequent circuit construction. Based on this decision diagram representation, the core of the algorithm developed by MicroCloud Hologram Inc. lies in directly utilizing the structure of the graph to construct quantum circuits, rather than blindly enumerating all basis states. The algorithm employs a single auxiliary qubit (initialized to |1?, acting as an unprocessed flag), with data qubits initialized to |0?. The entire process is completely deterministic, requiring no measurements or random post-selection. The algorithm first traverses the decision diagram in post-order, computes the local probability p_0 for each node (based on the sum of squared amplitudes of child nodes, with reduced nodes multiplied by a 2^e factor), and precomputes the corresponding Ry rotation gate G(p_0), which rotates |0? to vp_0|0? + v(1-p_0)|1?, encoding the branch probability entering that subtree. It then proceeds to pre-order traversal, recursively constructing the circuit starting from the root node: for branch nodes, it applies a doubly-controlled G(p_0) gate (controlled by the auxiliary qubit and the nearest |1? in the path) to the current qubit; for single-child nodes, it inserts a doubly-controlled X gate (CNOT) and handles half-probability rotations between reduced nodes; when reaching a terminal, it first applies a phase gate e^{i arg(a)} to adjust the amplitude phase, and finally uses a multi-controlled X gate (MCX, controlled by all branch nodes in the path) to flip the auxiliary qubit, marking it as |0? (processed). This design ensures that subsequent path preparation does not interfere with previously completed paths, as the auxiliary qubit acts as a protection switch on the processed subspace. The key to the technical implementation logic lies in the sharing and sequential processing of decision diagram paths. MicroCloud Hologram Inc. cleverly sorts the paths in descending binary value order (p1 ? p2 ? . ? pk), so that each time construction continues from the last common prefix node of the previous path, avoiding redundant operations. The number of gates contributed by each path is at most O(n), including n doubly-controlled gates (decomposed into 4-6 CNOTs) and one MCX (also decomposed into O(n) CNOTs). However, due to prefix sharing and node reduction, the actual total circuit complexity is only O(kn), i.e., linearly related to the number of paths k in the decision diagram, rather than to the number of non-zero amplitudes m or 2^n. This forms a sharp contrast with traditional methods: general preparation often requires O(m n) or even more gates and struggles to exploit structure; although early decision diagram-based methods offered some compression, they did not fully exploit path marking and reduction, resulting in higher gate counts. MicroCloud Hologram Inc.'s algorithm ensures a clean circuit and theoretically achieves a fidelity of 1 (under ideal noiseless conditions) through the auxiliary qubit’s path-locking mechanism and precise probability/phase injection, truly realizing deterministic preparation. It is particularly worth mentioning that the algorithm demonstrates extreme performance on the initial state of the quantum Byzantine agreement protocol. The quantum Byzantine agreement protocol is a key protocol for achieving consensus in distributed quantum computing, and its initial quantum state often exhibits a highly sparse decision diagram with specific shared substructures. MicroCloud Hologram Inc.'s experiments show that for the initial state of this protocol, the reduction in the number of CNOT gates ranges from 86.61% to 99.9%. This means that in actual multi-party quantum networks, the resource overhead in the protocol initialization phase is significantly reduced, with higher fidelity, thereby improving the overall reliability and scalability of the protocol. This application directly proves the practical value of the technology. Looking back at the development history of quantum computing, from Shor’s algorithm to Grover’s search, and then to variational quantum eigensolvers (VQE), every advancement has relied on efficient fundamental primitives.
