Related papers: Efficient Hamiltonian programming in qubit arrays …
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…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
We study the Hamiltonian-independent contribution to the complexity of quantum optimal control problems. The optimization of controls that steer quantum systems to desired objectives can itself be considered a classical dynamical system…
In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…
We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one…
Optimal quantum control of continuous variable systems poses a formidable computational challenge because of the high-dimensional character of the system dynamics. The framework of quantum invariants can significantly reduce the complexity…
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…
We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured…
The rapid growth in size of quantum devices demands efficient ways to control them, which is challenging for systems with thousands of qubits or more. Here, we present a simple yet powerful solution: robust, site-dependent control of an…
We present tools and methods to generalize parity compilation to digital quantum computing devices with arbitrary connectivity graphs and construct circuit implementations for the constraint Hamiltonian of higher-order constrained binary…
Planning energy production is a challenging task due to its cost-sensitivity, fast-moving energy markets, uncertainties in demand, and technical constraints of power plants. Thus, more complex models of this so-called \emph{unit commitment…
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
Effective Hamiltonian methods are utilized to model the two-qubit cross-resonance gate for both the ideal two-qubit case and when higher levels are included. Analytic expressions are obtained in the qubit case and the higher-level model is…
We propose a technique to design control algorithms for a class of finite dimensional quantum systems so that the control law does not present discontinuities. The class of models considered admits a group of symmetries which allows us to…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
Quantum computers may provide good solutions to combinatorial optimization problems by leveraging the Quantum Approximate Optimization Algorithm (QAOA). The QAOA is often presented as an algorithm for noisy hardware. However, hardware…
Fastness and robustness are both critical in the implementation of high-fidelity gates for quantum computation, but in practice, a trade-off has to be made between them. In this paper, we investigate the underlying robust time-optimal…
Characterization of qubit couplings in many-body quantum systems is essential for benchmarking quantum computation and simulation. We propose a tomographic measurement scheme to determine all the coupling terms in a general many-body…