14,538 research outputs found
DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical Restriction
Recently much attention has been paid to quantum circuit design to prepare
for the future "quantum computation era." Like the conventional logic
synthesis, it should be important to verify and analyze the functionalities of
generated quantum circuits. For that purpose, we propose an efficient
verification method for quantum circuits under a practical restriction. Thanks
to the restriction, we can introduce an efficient verification scheme based on
decision diagrams called
Decision Diagrams for Matrix Functions (DDMFs). Then, we show analytically
the advantages of our approach based on DDMFs over the previous verification
techniques. In order to introduce DDMFs, we also introduce new concepts,
quantum functions and matrix functions, which may also be interesting and
useful on their own for designing quantum circuits.Comment: 15 pages, 14 figures, to appear IEICE Trans. Fundamentals, Vol.
E91-A, No.1
No-signaling, entanglement-breaking, and localizability in bipartite channels
A bipartite quantum channel represents the interaction between systems,
generally allowing for exchange of information. A special class of bipartite
channels are the no-signaling ones, which do not allow communication. In Ref.
[1] it has been conjectured that all no-signaling channels are mixtures of
entanglement-breaking and localizable channels, which require only local
operations and entanglement. Here we provide the general realization scheme,
giving a counterexample to the conjecture.Comment: 4 pages, revtex
- ā¦