Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantum suppression law in a 3-D photonic chip implementing the Fast Fourier Transform
96
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong-Ou-Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from a fundamental perspective and for practical applications, such as certification of photonic quantum devices, whose computational speedup is expected to depend critically on multiparticle interference. Quantum distinctive features have been predicted for many particles injected into multimode interferometers implementing the Fourier transformation in the Fock space. In this work we develop a scalable approach for the implementation of quantum fast Fourier transform using 3-D photonic integrated interferometers, fabricated via femtosecond laser writing technique. We observe the quantum suppression of a large number of output states with 4- and 8-mode optical circuits: the experimental results demonstrate genuine quantum interference between the injected photons, thus offering a powerful tool for diagnostic of photonic platforms.
rate research
Read More
The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as $1/r^alpha$ in the distance $r$ provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shors algorithm to be performed on a $D$-dimensional lattice in time logarithmic in the number of qubits for interactions with $alpha le D$. As a corollary, we show that power-law systems with $alpha le D$ are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.
Hitting the exit node from the entrance node faster on a graph is one of the properties that quantum walk algorithms can take advantage of to outperform classical random walk algorithms. Especially, continuous-time quantum walks on central-random glued binary trees have been investigated in theories extensively for their exponentially faster hitting speed over classical random walks. Here, using heralded single photons to represent quantum walkers and waveguide arrays written by femtosecond laser to simulate the theoretical graph, we are able to demonstrate the hitting efficiency of quantum walks with tree depth as high as 16 layers for the first time. Furthermore, we expand the graphs branching rate from 2 to 5, revealing that quantum walks exhibit more superiority over classical random walks as branching rate increases. Our results may shed light on the physical implementation of quantum walk algorithms as well as quantum computation and quantum simulation.
Quantum Fourier transform (QFT) is a key ingredient of many quantum algorithms where a considerable amount of ancilla qubits and gates are often needed to form a Hilbert space large enough for high-precision results. Qubit recycling reduces the number of ancilla qubits to one but imposes the requirement of repeated measurements and feedforward within the coherence time of the qubits. Moreover, recycling only applies to certain cases where QFT can be carried out in a semi-classical way. Here, we report a novel approach based on two harmonic resonators which form a high-dimensional Hilbert space for the realization of QFT. By employing the all-resonant and perfect state-transfer methods, we develop a protocol that transfers an unknown multi-qubit state to one resonator. QFT is performed by the free evolution of the two resonators with a cross-Kerr interaction. Then, the fully-quantum result can be localized in the second resonator by a projective measurement. Qualitative analysis shows that a 2^10-dimensional QFT can be realized in current superconducting quantum circuits which paves the way for implementing various quantum algorithms in the noisy intermediate-scale quantum (NISQ) era.
Quantum teleportation is a fundamental concept in quantum physics which now finds important applications at the heart of quantum technology including quantum relays, quantum repeaters and linear optics quantum computing (LOQC). Photonic implementations have largely focussed on achieving long distance teleportation due to its suitability for decoherence-free communication. Teleportation also plays a vital role in the scalability of photonic quantum computing, for which large linear optical networks will likely require an integrated architecture. Here we report the first demonstration of quantum teleportation in which all key parts - entanglement preparation, Bell-state analysis and quantum state tomography - are performed on a reconfigurable integrated photonic chip. We also show that a novel element-wise characterisation method is critical to mitigate component errors, a key technique which will become increasingly important as integrated circuits reach higher complexities necessary for quantum enhanced operation.
The Quantum Fourier Transformation ($QFT$) is a key building block for a whole wealth of quantum algorithms. Despite its proven efficiency, only a few proof-of-principle demonstrations have been reported. Here we utilize $QFT$ to enhance the performance of a quantum sensor. We implement the $QFT$ algorithm in a hybrid quantum register consisting of a nitrogen-vacancy (NV) center electron spin and three nuclear spins. The $QFT$ runs on the nuclear spins and serves to process the sensor - NV electron spin signal. We demonstrate $QFT$ for quantum (spins) and classical signals (radio frequency (RF) ) with near Heisenberg limited precision scaling. We further show the application of $QFT$ for demultiplexing the nuclear magnetic resonance (NMR) signal of two distinct target nuclear spins. Our results mark the application of a complex quantum algorithm in sensing which is of particular interest for high dynamic range quantum sensing and nanoscale NMR spectroscopy experiments.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
