相关论文: Quantum implementation of circulant matrices and i…
We present a construction of Hermitian operators and quantum states labelled by strings from a finite field. The distance between these operators or states is then simply related (typically, proportional) to the Hamming distance between…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
As we continue to find applications where the currently available noisy devices exhibit an advantage over their classical counterparts, the efficient use of quantum resources is highly desirable. The notion of quantum autoencoders was…
Classical planar vertex models afford transfer matrices with real and positive entries, which makes this class of models suitable for quantum simulations. In this work, we support this statement by building explicit quantum circuits that…
A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in…
Large-alphabet strings are common in scenarios such as information retrieval and natural-language processing. The efficient storage and processing of such strings usually introduces several challenges that are not witnessed in…
This thesis focuses on quantum information processing using the superconducting device, especially, on realizing quantum gates and algorithms in open quantum systems. Such a device is constructed by transmon-type superconducting qubits…
Fault-tolerant quantum computation using two-dimensional topological quantum error correcting codes can benefit from multi-qubit long-range operations. By using simple commutation rules, a quantum circuit can be transpiled into a sequence…
We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…
Lexicographically minimal string rotation is a fundamental problem in string processing that has recently garnered significant attention in quantum computing. Near-optimal quantum algorithms have been proposed for solving this problem,…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
Recent years have seen unprecedented advance in the design and control of quantum computers. Nonetheless, their applicability is still restricted and access remains expensive. Therefore, a substantial amount of quantum algorithms research…
For a text given in advance, the substring minimal suffix queries ask to determine the lexicographically minimal non-empty suffix of a substring specified by the location of its occurrence in the text. We develop a data structure answering…
We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the…
Arrays of weakly-coupled quantum systems can be made to compute by subjecting them to a sequence of electromagnetic pulses of well-defined frequency and length. Such pulsed arrays are true quantum computers: bits can be placed in…
Quantum recursive programming has been recently introduced for describing sophisticated and complicated quantum algorithms in a compact and elegant way. However, implementation of quantum recursion involves intricate interplay between…
The quantum circuit model essentially treats every quantum algorithm as a straight-line program. While this view is universal, recent work has shown that it is inconvenient for using different-length quantum subroutines in superposition.…
We show that a superconducting circuit containing two loops, when treated with Macroscopic Quantum Coherence (MQC) theory, constitutes a complete two-bit quantum computer. The manipulation of the system is easily implemented with…
A potential implementation of quantum-computation schemes in semiconductor-based structures is proposed. In particular, an array of quantum dots is shown to be an ideal quantum register for a noiseless information encoding. In addition to…
Quantum algorithms have the potential to provide exponential speedups over some of the best known classical algorithms. These speedups may enable quantum devices to solve currently intractable problems such as those in the fields of…