Related papers: Optimized Compilation of Aggregated Instructions f…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
Qudits, generalizations of qubits to multi-level quantum systems, offer enhanced computational efficiency by encoding more information per lattice cell, avoiding costly swap operations and providing even exponential speedup in some cases.…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…
Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges…
There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable…
Parameterized circuit instantiation is a common technique encountered in the generation of circuits for a large class of hybrid quantum-classical algorithms. Despite being supported by popular quantum compilation infrastructures such as IBM…
Existing numerical optimizers deployed in quantum compilers use expensive $\mathcal{O}(4^n)$ matrix-matrix operations. Inspired by recent advances in quantum machine learning (QML), QFactor-Sample replaces matrix-matrix operations with…
The increasing capabilities of quantum computing hardware and the challenge of realizing deep quantum circuits require fully automated and efficient tools for compiling quantum circuits. To express arbitrary circuits in a sequence of native…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
Over the last decade, Quantum Computing hardware has rapidly developed and become a very intriguing, promising, and active research field among scientists worldwide. To achieve the desired quantum functionalities, quantum algorithms require…
Quantum computers with tens to hundreds of noisy qubits are being developed today. To be useful for real-world applications, we believe that these near-term systems cannot simply be scaled-down non-error-corrected versions of future…
As quantum computing technology matures, industry is adopting modular quantum architectures to keep quantum scaling on the projected path and meet performance targets. However, the complexity of chiplet-based quantum devices, coupled with…
Quantum circuit simulation is important in the evolution of quantum software and hardware. Novel algorithms can be developed and evaluated by performing quantum circuit simulations on classical computers before physical quantum computers…
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 computing hardware has progressed rapidly. Simultaneously, there has been a proliferation of programming languages and program optimization tools for quantum computing. Existing quantum compilers use intermediate representations…
Quantum-circuit optimization is essential for any practical realization of quantum computation, in order to beat decoherence. We present a scheme for implementing the final stage in the compilation of quantum circuits, i.e., for finding the…
Before executing a quantum algorithm, one must first decompose the algorithm into machine-level instructions compatible with the architecture of the quantum computer, a process known as quantum compiling. There are many different quantum…