Related papers: Efficient Algorithms for Quantum Hashing
Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to…
We introduce a simple, widely applicable formalism for designing "error-divisible" two qubit gates: a quantum gate set where fractional rotations have proportionally reduced error compared to the full entangling gate. In current noisy…
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not…
Quantum algorithms offer an exponential speedup over classical algorithms for a range of computational problems. The fundamental mechanisms underlying quantum computation required the development and construction of quantum computers. These…
A variety of photon-mediated operations are critical to the realization of scalable quantum information processing platforms and their accurate characterization is essential for the identification of optimal regimes and their experimental…
Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum…
Quantum devices use qubits to represent information, which allows them to exploit important properties from quantum physics, specifically superposition and entanglement. As a result, quantum computers have the potential to outperform the…
Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quantum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
Noisy Intermediate-Scale Quantum (NISQ) devices fail to produce outputs with sufficient fidelity for deep circuits with many gates today. Such devices suffer from read-out, multi-qubit gate and crosstalk noise combined with short…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
Many quantum states arising in algorithms and physical systems occupy only a small, structured subset of the exponentially large Hilbert space, yet standard quantum state tomography fails to exploit this structure. We present an efficient…
Current technological advancements of quantum computers highlight the need for application-driven, practical and well-defined methods of benchmarking their performance. As the existing NISQ device's quality of two-qubit gate errors rate is…
What is the time-optimal way of realizing quantum operations? Here, we show how important instances of this problem can be related to the study of shortest paths on the surface of a sphere under a special metric. Specifically, we provide an…
Circuit knitting emerges as a promising technique to overcome the limitation of the few physical qubits in near-term quantum hardware by cutting large quantum circuits into smaller subcircuits. Recent research in this area has been…
The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms, as the limited coherence time of physical qubits leads to noise that manifests as errors during computation. In this work, we…
In order to enter the era of utility, noisy intermediate-scale quantum (NISQ) devices need to enable long-range entanglement of large qubit chains. However, due to the limited connectivity of superconducting NISQ devices, long-range…
Numerous scientific developments in this NISQ-era (Noisy Intermediate Scale Quantum) have raised the importance for quantum algorithms relative to their conventional counterparts due to its asymptotic advantage. For resource estimates in…
Solving differential equations is one of the most promising applications of quantum computing. Recently we proposed an efficient quantum algorithm for solving one-dimensional Poisson equation avoiding the need to perform quantum arithmetic…
We study in detail the algebraic structures underlying quantum circuits generated by CNOT gates. Our results allow us to propose polynomial-time heuristics to reduce the number of gates used in a given CNOT circuit and we also give…