Related papers: Efficient $n$-qubit entangling operations via a su…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
Existing and near-term quantum computers can only perform two-qubit gates between physically connected qubits. Research has been done on compilers to rewrite quantum programs to match hardware constraints. However, the quantum processor…
We theoretically study single and two-qubit dynamics in the circuit QED architecture. We focus on the current experimental design [Wallraff et al., Nature 431, 162 (2004); Schuster et al., Nature 445, 515 (2007)] in which superconducting…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
We develop schemes for designing pulses that implement fast and precise entangling quantum gates in superconducting qubit systems despite the presence of nearby harmful transitions. Our approach is based on purposely involving the nearest…
Algorithms for quantum information processing are usually decomposed into sequences of quantum gate operations, most often realized with single- and two- qubit gates[1]. While such operations constitute a universal set for quantum…
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…
A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…
A quantum algorithm can be decomposed into a sequence consisting of single qubit and 2-qubit entangling gates. To optimize the decomposition and achieve more efficient construction of the quantum circuit, we can replace multiple 2-qubit…
Producing and maintaining entanglement reside at the heart of the optimal construction of quan- tum operations and are fundamental issues in the realization of universal quantum computation. We here introduce a setup of spin qubits that…
As quantum processors grow in scale and reliability, the need for efficient quantum gate decomposition of circuits to a set of specific available gates, becomes ever more critical. The decomposition of a particular algorithm into a sequence…
A quantum computer will use the properties of quantum physics to solve certain computational problems much faster than otherwise possible. One promising potential implementation is to use superconducting quantum bits in the circuit quantum…
Superconducting qubits are leading candidates in the race to build a quantum computer capable of realizing computations beyond the reach of modern supercomputers. The superconducting qubit modality has been used to demonstrate prototype…
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…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
The faster speed and operational convenience of two-qubit gate with flux bias control makes it an important candidate for future large-scale quantum computers based on high coherence flux qubits. Based on a properly designed two-spin gadget…
High-fidelity and robust quantum manipulation is the key for scalable quantum computation. Therefore, due to the intrinsic operational robustness, quantum manipulation induced by geometric phases is one of the promising candidates. However,…
We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed…