Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient backcasting search for optical quantum state synthesis
164
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Non-Gaussian states are essential for many quantum technologies with continuous variables. The so-called optical quantum state synthesizer (OQSS), consisting of Gaussian input states, linear optics, and photon-number resolving detectors, is a promising method for non-Gaussian state preparation. However, an inevitable and crucial problem is the complexity of the numerical simulation of the state preparation on a classical computer. To remedy this, we offer an efficient scheme employing a backcasting approach, where the circuit of OQSS is devided into some sublayers, and we simulate the OQSS backwards from final to first layers. As an important example and application, we numerically show that the proposed OQSS allows us to simulate the generation of the Gottesman-Kitaev-Preskill qubit with a fidelity sufficient for universality and fault tolerance in optical quantum computation. Moreover, our results show that the detected photon number by each detector is at most 2, which can significantly reduce the requirements for the photon-number resolving detector. Further, by virtue of the potential for the preparation of a wide variety of non-Gaussian states, the proposed OQSS can be a key ingredient in general optical quantum information processing.
rate research
Read More
We present a theoretical analysis of different methods to synthesize entangled states of two superconducting resonators. These methods use experimentally demonstrated interactions of resonators with artificial atoms, and offer efficient routes to generate nonclassical states. We analyze the theoretical structure of these algorithms and their average performance for arbitrary states and for deterministically preparing NOON states. Using a new state synthesis algorithm, we show that NOON states can be prepared in a time linear in the desired photon number and without any state-selective interactions.
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grovers search algorithm finds the target element in an unsorted database with quadratic speedup than classical search and has been proved to be optimal in terms of the number of queries to the database. The challenge, however, is that Grovers search algorithm leads to high numbers of quantum gates, which make it infeasible for the Noise-Intermediate-Scale-Quantum (NISQ) computers. In this paper, we propose a novel hardware efficient quantum search algorithm to overcome this challenge. Our key idea is to replace the global diffusion operation with low-cost local diffusions. Our analysis shows that our algorithm has similar oracle complexity to the original Grovers search algorithm while significantly reduces the circuit depth and gate count. The circuit cost reduction leads to a remarkable improvement in the system success rates, paving the way for quantum search on NISQ machines.
In the era of noisy intermediate-scale quantum (NISQ), executing quantum algorithms on actual quantum devices faces unique challenges. One such challenge is that quantum devices in this era have restricted connectivity: quantum gates are allowed to act only on specific pairs of physical qubits. For this reason, a quantum circuit needs to go through a compiling process called qubit routing before it can be executed on a quantum computer. In this study, we propose a CNOT synthesis method called the token reduction method to solve this problem. The token reduction method works for all quantum computers whose architecture is represented by connected graphs. A major difference between our method and the existing ones is that our method synthesizes a circuit to an output qubit mapping that might be different from the input qubit mapping. The final mapping for the synthesis is determined dynamically during the synthesis process. Results showed that our algorithm consistently outperforms the best publicly accessible algorithm for all of the tested quantum architectures.
Quantum information offers the promise of being able to perform certain communication and computation tasks that cannot be done with conventional information technology (IT). Optical Quantum Information Processing (QIP) holds particular appeal, since it offers the prospect of communicating and computing with the same type of qubit. Linear optical techniques have been shown to be scalable, but the corresponding quantum computing circuits need many auxiliary resources. Here we present an alternative approach to optical QIP, based on the use of weak cross-Kerr nonlinearities and homodyne measurements. We show how this approach provides the fundamental building blocks for highly efficient non-absorbing single photon number resolving detectors, two qubit parity detectors, Bell state measurements and finally near deterministic control-not (CNOT) gates. These are essential QIP devices
We present a quantum synthesis algorithm designed to produce short circuits and to scale well in practice. The main contribution is a novel representation of circuits able to encode placement and topology using generic gates, which allows the QFAST algorithm to replace expensive searches over circuit structures with few steps of numerical optimization. When compared against optimal depth, search based state-of-the-art techniques, QFAST produces comparable results: 1.19x longer circuits up to four qubits, with an increase in compilation speed of 3.6x. In addition, QFAST scales up to seven qubits. When compared with the state-of-the-art rule based decomposition techniques in Qiskit, QFAST produces circuits shorter by up to two orders of magnitude (331x), albeit 5.6x slower. We also demonstrate the composability with other techniques and the tunability of our formulation in terms of circuit depth and running time.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
