We question whether the measurement based quantum computing algorithm is in fact Grovers algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4 element searc
h, which is the largest size photonic search algorithm that has been experimentally implemented to date. This has led some to refer to both substantiations as Grovers algorithm. We compare multiple features of the two algorithms including the behavior of the oracle tags and the entanglement dynamics, both qualitatively and quantitatively. We find significant and fundamental differences in the operation of the two algorithms, particularly in cases involving searches on more than four elements.
We find that the Measurement Based Quantum Computing (MBQC) search algorithm on an unsorted list is not the same as Grovers search algorithm (GSA).
Here we propose a new design paradigm for a superconducting nanowire single photon detector that uses a multi-layer architecture that places the electric leads beneath the nanowires. This allows for a very large number of detector elements, which we
will call pixels in analogy to a conventional CCD camera, to be placed in close proximity. This leads to significantly better photon number resolution than current single and multi-nanowire meanders, while maintaining similar detection areas. We discuss the reset time of the pixels and how the design can be modified to avoid the latching failure seen in extremely short superconducting nanowires. These advantages give a multi-layer superconducting number-resolving photon detector significant advantages over the current design paradigm of long superconducting nanowire meanders. Such advantages are desirable in a wide array of photonics applications.
Here we propose an experiment in Linear Optical Quantum Computing (LOQC) using the framework first developed by Knill, Laflamme, and Milburn. This experiment will test the ideas of the authors previous work on imperfect LOQC gates using number-resolv
ing photon detectors. We suggest a relatively simple physical apparatus capable of producing CZ gates with controllable fidelity less than 1 and success rates higher than the current theoretical maximum (S=2/27) for perfect fidelity. These experimental setups are within the reach of many experimental groups and would provide an interesting experiment in photonic quantum computing.
We use the numerical optimization techniques of Uskov et al. [PRA 81, 012303 (2010)] to investigate the behavior of the success rates for KLM style [Nature 409, 46 (2001)] two- and three-qubit entangling gates. The methods are first demonstrated at p
erfect fidelity, and then extended to imperfect gates. We find that as the perfect fidelity condition is relaxed, the maximum attainable success rates increase in a predictable fashion depending on the size of the system, and we compare that rate of increase for several gates.
We discuss a modification to Random Matrix Theory eigenstate statistics, that systematically takes into account the non-universal short-time behavior of chaotic systems. The method avoids diagonalization of the Hamiltonian, instead requiring only a k
nowledge of short-time dynamics for a chaotic system or ensemble of similar systems. Standard Random Matrix Theory and semiclassical predictions are recovered in the limits of zero Ehrenfest time and infinite Heisenberg time, respectively. As examples, we discuss wave function autocorrelations and cross-correlations, and show that significant improvement in accuracy is obtained for simple chaotic systems where comparison can be made with brute-force diagonalization. The accuracy of the method persists even when the short-time dynamics of the system or ensemble is known only in a classical approximation. Further improvement in the rate of convergence is obtained when the method is combined with the correlation function bootstrapping approach introduced previously.
We combine numerical optimization techniques [Uskov et al., Phys. Rev. A 79, 042326 (2009)] with symmetries of the Weyl chamber to obtain optimal implementations of generic linear-optical KLM-type two-qubit entangling gates. We find that while any tw
o-qubit controlled-U gate, including CNOT and CS, can be implemented using only two ancilla resources with success probability S > 0.05, a generic SU(4) operation requires three unentangled ancilla photons, with success S > 0.0063. Specifically, we obtain a maximal success probability close to 0.0072 for the B gate. We show that single-shot implementation of a generic SU(4) gate offers more than an order of magnitude increase in the success probability and two-fold reduction in overhead ancilla resources compared to standard triple-CNOT and double-B gate decompositions.
Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the 2-qubit CS (or CNOT) gate, we provide numerical evidence that the maximum success
rate is $S=2/27$ using two unentangled ancilla resources; interestingly, additional ancilla resources do not increase the success rate. For the 3-qubit Toffoli gate, we show that perfect fidelity is obtained with only three unentangled ancilla photons -- less than in any existing scheme -- with a maximum $S=0.00340$. This compares well with $S=(2/27)^2/2 approx 0.00274$, obtainable by combining two CNOT gates and a passive quantum filter [PRA 68, 064303 (2003)]. The general optimization approach can easily be applied to other areas of interest, such as quantum error correction, cryptography, and metrology [arXiv:0807.4906, PRL 99 070801 (2007)].
