We present two methods for the construction of quantum circuits for quantum errorcorrecting codes (QECC). The underlying quantum systems are tensor products of subsystems (qudits) of equal dimension which is a prime power. For a QECC encoding k qudits into n qudits, the resulting quantum circuit has O(n(n− k)) gates. The running time of the classical algorithm to compute the quantum circuit is ...

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...

Abstract A black hole laser in analogues of gravity amplifies Hawking radiation, which is unlikely to be measured real holes, and makes it observable. There have been proposals realize such lasers various systems. However, no progress has made electric circuits for a long time, despite their many advantages as high-precision electromagnetic wave detection. Here we propose Josephson transmission...

A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction between two qubits is undesirable since, it can be interpreted as a noise. Therefore, multiple quantum technologies and quantum error correcting codes strongl...

The commonly used circuit model of quantum computing leaves out the problems of state preparation (how to get the individual particles into a specific state while ensuring that the particles remain entangled), particle statistics (indistinguishability of quantum particles belonging to the same coherent state), and error correction (current techniques cannot correct all small errors). The initia...

In the eld of quantum information science, one can design a series of quantum logic operations known as a circuit. Circuits are the basis for quantum computations in quantum computing. As circuits will most likely be designed from a logical standpoint, there could exist mathematical redundancies which will lead to a larger circuit than necessary. These redundancies are computationally expensive...

High-connectivity circuits are a major roadblock for current quantum hardware. We propose hybrid classical-quantum algorithm to simulate such without swap-gate ladders. As the main technical tool, we introduce quantum-classical-quantum interfaces. These replace an experimentally problematic gate (e.g., long-range one) with single-qubit random measurements followed by state preparations sampled ...

Quantum Boolean circuit synthesis issues are becoming a key area of research in the domain of quantum computing. For gate-level synthesis, minterm based and ReedMuller canonical decomposition techniques are adopted as common approaches. Physical implementation of quantum circuits have inherent constraints and hence nearest neighbour template of input lines is gaining importance. In this work, w...