A5072023688- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum-Dot Cellular Automata
- Parallel Computing and Optimization Techniques
- Particle Detector Development and Performance
- Constraint Satisfaction and Optimization
- CCD and CMOS Imaging Sensors
Delft University of Technology
2020-2024
Unitary decomposition is a widely used method to map quantum algorithms an arbitrary set of gates. Efficient implementation this allows for the translation bigger unitary gates into elementary operations, which key executing these on existing computers. The can be as aggressive optimization whole circuit, well test part algorithm accelerator. For selection and algorithm, perfect qubits are assumed. We base our technique Quantum Shannon Decomposition, generates O(344n) controlled-not n-qubit...
With the potential of quantum algorithms to solve intractable classical problems, computing is rapidly evolving, and more are being developed optimized. Expressing these using a high-level language making them executable on processor while abstracting away hardware details challenging task. First, programming should provide an intuitive interface describe those algorithms. Then compiler has transform program into circuit, optimize it, map it target respecting constraints such as supported...
This paper presents the definition and implementation of a quantum computer architecture to enable creating new computational device - as an accelerator. A key question addressed is what such how it relates classical processor that controls entire execution process. In this paper, we present explicitly idea accelerator which contains full stack layers Such starts at highest level describing target application The next layer abstracts logic outlining algorithm be executed on our case,...
This article presents the definition and implementation of a quantum computer architecture to enable creating new computational device-a as an accelerator. A key question addressed is what such how it relates classical processor that controls entire execution process. In this article, we present explicitly idea accelerator contains full stack layers Such starts at highest level describing target application The next layer abstracts logic outlining algorithm be executed on our case, expressed...
This paper presents the definition and implementation of a quantum computer architecture to enable creating new computational device - as an accelerator In this paper, we present explicitly idea which contains full stack layers accelerator. Such starts at highest level describing target application Important realise is that qubits are defined perfect qubits, implying they do not decohere perform good gate operations. The next layer abstracts logic outlining algorithm be executed on our case,...
Near term quantum devices have the potential to outperform classical computing through use of hybrid classical-quantum algorithms such as Variational Quantum Eigensolvers. These iterative a optimiser update parameterised circuit. Each iteration, circuit is executed on physical processor or simulator, and average measurement result passed back optimiser. When many iterations are required, whole program also recompiled times. We implemented explicit parameters that prevent recompilation in...
In this paper, we show the design and implementation of a quantum algorithm for industrial shift scheduling (QISS), which uses Grover's adaptive search to tackle common important class valuable, real-world combinatorial optimization problems. We give an explicit circuit construction oracle, incorporating multiple constraints present in problem, detail corresponding logical-level resource requirements. Further, simulate application QISS specific small-scale problem instances corroborate...
This paper proposes a new optimized quantum block-ZXZ decomposition method [4,5,6] that results in the construction of more optimal circuits than Shannon (QSD) [17] can achieve, which has been most since 2006. With proposed decomposition, general 3-qubit gate be decomposed using 19 CNOT gates (rather 20). For n-qubit gates, generates have $(22/48) 4^n - (3/2) 2^n + (5/3)$ , is less best known exact algorithm by $(4^{n-2} -1)/3$ gates.
In this paper, we use open-source tools to perform quantum resource estimation assess the requirements for industry-relevant computation. Our analysis uses problem of industrial shift scheduling in manufacturing and Quantum Industrial Shift Scheduling algorithm. We base our figures merit on current technology, as well theoretical high-fidelity scenarios superconducting qubit platforms. find that execution time gate measurement operations determines overall computational runtime more strongly...