Related papers: Generating a state $t$-design by diagonal quantum …
Decoupling has become a central concept in quantum information theory with applications including proving coding theorems, randomness extraction and the study of conditions for reaching thermal equilibrium. However, our understanding of the…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state,…
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum…
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…
Dynamic quantum circuits incorporate mid-circuit measurements and feed-forward operations originally intended to realize Quantum Error Correction. This paradigm has recently been utilized to prepare certain states and long-range entangling…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In…
Probabilistic graphical models such as Bayesian networks are widely used to model stochastic systems to perform various types of analysis such as probabilistic prediction, risk analysis, and system health monitoring, which can become…
We propose a quantum computation architecture based on geometries with nearest-neighbor interactions, including e.g. planar structures. We show how to efficiently split the role of qubits into data and entanglement-generation qubits.…
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
Shortcuts to adiabaticity provides a flexible method to accelerate and improve a quantum control task beyond adiabatic criteria. Here we propose the reverse-engineering approach to design the longitudinal coupling between a set of qubits…
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal $T$ gate play an important role in implementing a universal set of quantum operations. This paper…
Quantum states with nonlinear squeezing are a necessary resource for deterministic implementation of high-order quadrature phase gates that are, in turn, sufficient for advanced quantum information processing. We demonstrate that this class…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…
While quantum state tomography is notoriously hard, most states hold little interest to practically-minded tomographers. Given that states and unitaries appearing in Nature are of bounded gate complexity, it is natural to ask if efficient…