Related papers: Numerical circuit synthesis and compilation for mu…
We experimentally explore the state space of three qubits on an NMR quantum information processor. We construct a scheme to experimentally realize a canonical form for general three-qubit states up to single-qubit unitaries. This form…
This research applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. A tutorial-style introduction to states and various notions of the complexity of states are presented. Thereafter, the…
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific…
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…
Over a decade ago, it was demonstrated that quantum computing has the potential to revolutionize numerical linear algebra by enabling algorithms with complexity superior to what is classically achievable, e.g., the seminal HHL algorithm for…
Estimation of quantum states and measurements is crucial for the implementation of quantum information protocols. The standard method for each is quantum tomography. However, quantum tomography suffers from systematic errors caused by…
Quantum state preparation is a critical task in quantum computing, particularly in fields such as quantum machine learning, Hamiltonian simulation, and quantum algorithm design. The depth of preparation circuit for the most general state…
We propose a method for finding approximate compilations of quantum unitary transformations, based on techniques from policy gradient reinforcement learning. The choice of a stochastic policy allows us to rephrase the optimization problem…
We present one-shot compression protocols that optimally encode ensembles of $N$ identically prepared mixed states into $O(\log N)$ qubits. In contrast to the case of pure-state ensembles, we find that the number of encoding qubits drops…
In scenarios where full access to all qubits of a multipartite quantum system is available and global operations can be implemented, the preparation of arbitrary entangled states is theoretically straightforward. However, practical…
Current proposals for quantum compilers require the synthesis and optimization of linear reversible circuits and among them CNOT circuits. Since these circuits represent a significant part of the cost of running an entire quantum circuit,…
The protocols for controlled remote state preparation of a single qubit and a general two-qubit state are presented in this paper. The general pure three-qubit states are chosen as shared quantum channel, which are not LOCC equivalent to…
Certain quantum many-body ground states can be prepared by a large-depth quantum circuit consisting of geometrically local gates. In the presence of noise, local expectation values deviate from the correct value at most by an amount…
At the moment, quantum circuits are created mainly by manually placing logic elements on lines that symbolize quantum bits. The purpose of creating Quantum Circuit Synthesizer "Naginata" was due to the fact that even with a slight increase…
Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If state preparation is too…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
Noisy, intermediate-scale quantum (NISQ) computers are expected to execute quantum circuits of up to a few hundred qubits. The circuits have to conform to NISQ architectural constraints regarding qubit allocation and the execution of…
The important problem of how to prepare a quantum mechanical system, $S$, in a specific initial state of interest - e.g., for the purposes of some experiment - is addressed. Three distinct methods of state preparation are described. One of…
Quantum computing algorithms require that the quantum register be initially present in a superposition state. To achieve this, we consider the practical problem of creating a coherent superposition state of several qubits. Owing to…
The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gates, and even the number of physical qubits. In this work, we…