Related papers: Mechanism behind creating qubit gates expressed as…
The information of quantum pathways can be extracted in the framework of the Hamiltonian-encoding and Observable-decoding method. For closed quantum systems, only off-diagonal elements of the Hamiltonian in the Hilbert space is required to…
We present an encoding technique that reduces the effects of noise on quantum spin systems whose operation is driven by Hamiltonian evolution. This technique is widely applicable, being most relevant to the scenarios where there are…
Constructing a set of universal quantum gates is a fundamental task for quantum computation. The existence of noises, disturbances and fluctuations is unavoidable during the process of implementing quantum gates for most practical quantum…
Optimal control techniques provide a means to tailor the control pulses required to generate customized quantum gates, which helps to improve the resilience of quantum simulations to gate errors and device noise. However, the significant…
The recent experimental advances in capacitively coupled singlet-triplet qubits, particularly the demonstration of entanglement, opens the question of what type of entangling gates the system's Hamiltonian can produce directly via a single…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is available, the set of implementable quantum gates is easily…
In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…
Explicit controlled-NOT gate sequences between two qubits of different types are presented in view of applications for large-scale quantum computation. Here, the building blocks for such composite systems are qubits based on the…
We present a unitary control pulse design method for a scalable quantum computer architecture based on electron spins in lateral quantum dots. We employ simultaneous control of spin interactions and derive the functional forms of spin…
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…
Reducing the circuit depth of quantum circuits is a crucial bottleneck to enabling quantum technology. This depth is inversely proportional to the number of available quantum gates that have been synthesised. Moreover, quantum gate…
Superconducting qubits are a promising candidate for building a quantum computer. A continued challenge for fast yet accurate gates to minimize the effects of decoherence. Here we apply numerical methods to design fast entangling gates,…
Topological quantum computing has recently proven itself to be a very powerful model when considering large- scale, fully error corrected quantum architectures. In addition to its robust nature under hardware errors, it is a software driven…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Qubitization is a modern approach to estimate Hamiltonian eigenvalues without simulating its time evolution. While in this way approximation errors are avoided, its resource and gate requirements are more extensive: qubitization requires…
The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the CNOT gate can be realized easily. It can be shown that, e.g., with the XY interaction more than one two-qubit…