Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Tan, Bochen"'
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more efficient and ac
Externí odkaz:
http://arxiv.org/abs/2401.01009
With the steady progress in quantum computing over recent years, roadmaps for upscaling quantum processors have relied heavily on the targeted qubit architectures. So far, similarly to the early age of classical computing, these designs have been cra
Externí odkaz:
http://arxiv.org/abs/2207.14482
Autor:
Tan, Bochen, Cong, Jason
Before quantum error correction (QEC) is achieved, quantum computers focus on noisy intermediate-scale quantum (NISQ) applications. Compared to the well-known quantum algorithms requiring QEC, like Shor's or Grover's algorithm, NISQ applications have
Externí odkaz:
http://arxiv.org/abs/2109.06445
Autor:
Tan, Bochen, Cong, Jason
Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum comp
Externí odkaz:
http://arxiv.org/abs/2007.15671
Autor:
Tan, Bochen, Cong, Jason
Layout synthesis, an important step in quantum computing, processes quantum circuits to satisfy device layout constraints. In this paper, we construct QUEKO benchmarks for this problem, which have known optimal depths and gate counts. We use QUEKO to
Externí odkaz:
http://arxiv.org/abs/2002.09783
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.