Related papers: Hidden Quantum Advantage near the Decoding Thresho…
This is the second of the two related papers analysing origins and possible explanations of a paradoxical phenomenon of the quantum potential (QP). It arises in quantum mechanics'(QM) of a particle in the Riemannian $n$-dimensional…
Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and…
Quantum Fano inequality (QFI) in quantum information theory provides an upper bound to the entropy exchange by a function of the entanglement fidelity. We give various Fano-like upper bounds to the entropy exchange and QFI is a special case…
We propose a quantum-enhanced lidar system to estimate a target's radial velocity which employs squeezed and frequency entangled signal and idler beams. We compare its performance against a classical protocol using a coherent state with the…
Quantum advantage schemes probe the boundary between classically simulatable and classically intractable quantum dynamics. We explore the impact of mid-circuit measurements on the computational power of quantum circuits. To this effect, we…
Quantum hypothesis testing is one of the most fundamental problems in quantum information theory, with crucial implications in areas like quantum sensing, where it has been used to prove quantum advantage in a series of binary photonic…
We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific…
There is no unique way to encode a quantum algorithm into a quantum circuit. With limited qubit counts, connectivities, and coherence times, circuit optimization is essential to make the best use of near-term quantum devices. We introduce…
Medium-scale quantum devices that integrate about hundreds of physical qubits are likely to be developed in the near future. However, such devices will lack the resources for realizing quantum fault tolerance. Therefore, the main challenge…
A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We partially solve this problem. We demonstrate…
Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however,…
The ambition of harnessing the quantum for computation is at odds with the fundamental phenomenon of decoherence. The purpose of quantum error correction (QEC) is to counteract the natural tendency of a complex system to decohere. This…
Are quantum advantages in discrete manufacturing achievable in the near term? As manufacturing-relevant NISQ algorithms, we identified Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) for combinatorial…
Quantum annealing correction (QAC) is a method that combines encoding with energy penalties and decoding to suppress and correct errors that degrade the performance of quantum annealers in solving optimization problems. While QAC has been…
In theory, quantum key distribution (QKD) offers unconditional security based on the laws of physics. However, as demonstrated in recent quantum hacking theory and experimental papers, detection efficiency loophole can be fatal to the…
Recent experimental breakthroughs have signalled the imminent arrival of the early fault-tolerant era. However, for a considerable period in the foreseeable future, relying solely on quantum error correction for full error suppression will…
We theoretically derive the lower and upper bounds of quantum Fisher information (QFI) of an SU(1,1) interferometer whatever the input state chosen. According to the QFI, the crucial resource for quantum enhancement is shown to be large…
We introduce a new analysis technique to derive a single-letter upper bound on the mismatch capacity of a stationary, single-user, memoryless channel with a decoding metric $q$. Our bound is obtained by considering a multicast transmission…
Along with the development of quantum technology, finding useful applications of quantum computers has been a central pursuit. Despite various quantum algorithms have been developed, many of them often require strong input assumptions,…
Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. Since they require few hardware components while also allowing for long-range entanglement, they are strong candidates for…