arXiv subjects

Simon Benjamin

Publications and source records attributed to Simon Benjamin.

22 records · Page 2Linked to original sources

arXiv2018

Quantum metrology beyond the classical limit under the effect of dephasing

Quantum sensors have the potential to outperform their classical counterparts. For classical sensing, the uncertainty of the estimation of the target fields scales inversely with the square root of the measurement time T. On the other hand, by using quantum resources, we can reduce this scaling of the uncertainty with time to 1/T. However, as quantum states are susceptible to dephasing, it has not been clear whether we can achieve sensitivities with a scaling of 1/T for a measurement time longer than the coherence time. Here, we propose a scheme that estimates the amplitude of globally applied fields with the uncertainty of 1/T for an arbitrary time scale under the effect of dephasing. We use one-way quantum computing based teleportation between qubits to prevent any increase in the correlation between the quantum state and its local environment from building up and have shown that such a teleportation protocol can suppress the local dephasing while the information from the target fields keeps growing. Our method has the potential to realize a quantum sensor with a sensitivity far beyond that of any classical sensor.

quant-ph↗

arXiv2016

Magnetic field sensing with quantum error detection under the effect of energy relaxation

A solid state spin is an attractive system with which to realize an ultra-sensitive magnetic field sensor. A spin superposition state will acquire a phase induced by the target field, and we can estimate the field strength from this phase. Recent studies have aimed at improving sensitivity through the use of quantum error correction (QEC) to detect and correct any bit-flip errors that may occur during the sensing period. Here, we investigate the performance of a two-qubit sensor employing QEC and under the effect of energy relaxation. Surprisingly, we find that the standard QEC technique to detect and recover from an error does not improve the sensitivity compared with the single-qubit sensors. This is a consequence of the fact that the energy relaxation induces both a phase-flip and a bit-flip noise where the former noise cannot be distinguished from the relative phase induced from the target fields. However, we have found that we can improve the sensitivity if we adopt postselection to discard the state when error is detected. Even when quantum error detection is moderately noisy, and allowing for the cost of the postselection technique, we find that this two-qubit system shows an advantage in sensing over a single qubit in the same conditions.

quant-ph↗

arXiv2016

Interference-based molecular transistors

Molecular transistors have the potential for switching with lower gate voltages than conventional field-effect transistors. We have calculated the performance of a single-molecule device in which there is interference between electron transport through the highest occupied molecular orbital and the lowest unoccupied molecular orbital of a single molecule. Quantum interference results in a subthreshold slope that is independent of temperature. For realistic parameters the change in gate potential required for a change in source-drain current of two decades is 20 mV, which is a factor of six smaller than the theoretical limit for a metal-oxide-semiconductor field-effect transistor.

cond-mat.mes-hall↗

arXiv2015

Performance of a measurement-driven 'adiabatic-like' quantum 3-SAT solver

I describe one quantum approach to solving 3-satisfiability (3-SAT), the well known problem in computer science. The approach is based on repeatedly measuring the truth value of the clauses forming the 3-SAT proposition using a non-orthogonal basis. If the basis slowly evolves then there is a strong analogy to adiabatic quantum computing, although the approach is entirely circuit-based. To solve a 3-SAT problem of n variables requires a quantum register of $n$ qubits, or more precisely rebits i.e. qubits whose phase need only be real. For cases of up to n=26 qubits numerical simulations indicate that the algorithm runs fast, outperforming Grover's algorithm and having a scaling with n that is superior to the best reported classical algorithms. There are indications that the approach has an inherent robustness versus imperfections in the elementary operations.

quant-ph↗