Quantum-state preparation with universal gate decompositions

By Martin Plesch, V. Brukner. 2010

345 citations recorded by the source corpus.

In quantum computation every unitary operation can be decomposed into quantum circuits, a series of single qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 2. It also reduces the total number of cnot gates from 2n to 23/242n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 11 cnot gates to 9 and the depth from 11 to 5 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/f5f223d4538d4d04be680bc5b43b64bef82e9b0f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Circuit-centric quantum classifiers (2018, background): “For current algorithms c sgl and c cn is equal to or slighly larger than 1 [22–24, 43, 44].”
Quantum Computing for Finance: State-of-the-Art and Future Prospects (2020, background): “The loading of arbitrary states into quantum systems, however, requires exponentially many gates [56], making it inefficient to model arbitrary distributions as quantum gates.”
Option Pricing using Quantum Computers (2019, background): “The loading of arbitrary states into quantum systems requires exponentially many gates [33], making it inefficient to model arbitrary distributions as quantum gates.”