Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (4)
  • Open Access

    ARTICLE

    Optimized General Uniform Quantum State Preparation

    Mark Ariel Levin*

    Journal of Quantum Computing, Vol.6, pp. 15-24, 2024, DOI:10.32604/jqc.2024.047423

    Abstract Quantum algorithms for unstructured search problems rely on the preparation of a uniform superposition, traditionally achieved through Hadamard gates. However, this incidentally creates an auxiliary search space consisting of nonsensical answers that do not belong in the search space and reduce the efficiency of the algorithm due to the need to neglect, un-compute, or destructively interfere with them. Previous approaches to removing this auxiliary search space yielded large circuit depth and required the use of ancillary qubits. We have developed an optimized general solver for a circuit that prepares a uniform superposition of any N states while minimizing depth and… More >

  • Open Access

    ARTICLE

    Quantum Remote State Preparation Based on Quantum Network Coding

    Zhen-Zhen Li1, Zi-Chen Li1, Yi-Ru Sun2,3,*, Haseeb Ahmad4, Gang Xu5,6, Xiu-Bo Chen3

    CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 119-132, 2022, DOI:10.32604/cmc.2022.027437

    Abstract As an innovative theory and technology, quantum network coding has become the research hotspot in quantum network communications. In this paper, a quantum remote state preparation scheme based on quantum network coding is proposed. Comparing with the general quantum remote state preparation schemes, our proposed scheme brings an arbitrary unknown quantum state finally prepared remotely through the quantum network, by designing the appropriate encoding and decoding steps for quantum network coding. What is worth mentioning, from the network model, this scheme is built on the quantum k-pair network which is the expansion of the typical bottleneck network—butterfly network. Accordingly, it… More >

  • Open Access

    ARTICLE

    An Asymmetric Controlled Bidirectional Quantum State Transmission Protocol

    Yiru Sun1,2, Yuling Chen1,*, Haseeb Ahmad3, Zhanhong Wei4

    CMC-Computers, Materials & Continua, Vol.59, No.1, pp. 215-227, 2019, DOI:10.32604/cmc.2019.05253

    Abstract In this paper, we propose an asymmetric controlled bidirectional transmission protocol. In the protocol, by using the thirteen-qubit entangled state as the quantum channel, Alice can realize the transmission of a two-qubit equatorial state for Bob and Bob can transmit a four-qubit equatorial state for Alice under the control of Charlie. Firstly, we give the construction of the quantum channel, which can be done by performing several H and CNOT operations. Secondly, through implementing the appropriate measurements and the corresponding recovery operations, the desired states can be transmitted simultaneously, securely and deterministically. Finally, we analyze the performance of the protocol,… More >

  • Open Access

    ARTICLE

    Controlled Cyclic Remote State Preparation of Arbitrary Qubit States

    Mingming Wang1,2,*, Chen Yang1, Reza Mousoli3

    CMC-Computers, Materials & Continua, Vol.55, No.2, pp. 321-329, 2018, DOI:10.3970/cmc.2018.02064

    Abstract Quantum secure communications could securely transmit quantum information by using quantum resource. Recently, novel applications such as bidirectional and asymmetric quantum protocols have been developed. In this paper, we propose a new method for generating entanglement which is highly useful for multiparty quantum communications such as teleportation and Remote State Preparation (RSP). As one of its applications, we propose a new type of quantum secure communications, i.e. cyclic RSP protocols. Starting from a four-party controlled cyclic RSP protocol of one-qubit states, we show that this cyclic protocol can be generalized to a multiparty controlled cyclic RSP protocol for preparation of… More >

Displaying 1-10 on page 1 of 4. Per Page