skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The Complexity of Bit Retrieval

Abstract

Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.

Authors:
ORCiD logo [1]
  1. Cornell Univ., Ithaca, NY (United States). Dept. of Physics
Publication Date:
Research Org.:
SLAC National Accelerator Lab., Menlo Park, CA (United States)
Sponsoring Org.:
USDOE; Simons Foundation
OSTI Identifier:
1417635
Grant/Contract Number:
SC0005827; AC02-76SF00515; FG02-11ER16210
Resource Type:
Journal Article: Accepted Manuscript
Journal Name:
IEEE Transactions on Information Theory
Additional Journal Information:
Journal Volume: 64; Journal Issue: 1; Journal ID: ISSN 0018-9448
Publisher:
IEEE
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; Phase retrieval; periodic autocorrelation; reconstruction algorithms

Citation Formats

Elser, Veit. The Complexity of Bit Retrieval. United States: N. p., 2018. Web. doi:10.1109/TIT.2017.2754485.
Elser, Veit. The Complexity of Bit Retrieval. United States. doi:10.1109/TIT.2017.2754485.
Elser, Veit. Thu . "The Complexity of Bit Retrieval". United States. doi:10.1109/TIT.2017.2754485.
@article{osti_1417635,
title = {The Complexity of Bit Retrieval},
author = {Elser, Veit},
abstractNote = {Bit retrieval is the problem of reconstructing a periodic binary sequence from its periodic autocorrelation, with applications in cryptography and x-ray crystallography. After defining the problem, with and without noise, we describe and compare various algorithms for solving it. A geometrical constraint satisfaction algorithm, relaxed-reflect-reflect, is currently the best algorithm for noisy bit retrieval.},
doi = {10.1109/TIT.2017.2754485},
journal = {IEEE Transactions on Information Theory},
number = 1,
volume = 64,
place = {United States},
year = {Thu Sep 20 00:00:00 EDT 2018},
month = {Thu Sep 20 00:00:00 EDT 2018}
}

Journal Article:
Free Publicly Available Full Text
This content will become publicly available on September 20, 2019
Publisher's Version of Record

Save / Share:
  • In this paper, we demonstrate how optimal control methods can be used to speed up the implementation of modules of quantum algorithms or quantum simulations in networks of coupled qubits. The gain is most prominent in realistic cases, where the qubits are not all mutually coupled. Thus the shortest times obtained depend on the coupling topology as well as on the characteristic ratio of the time scales for local controls vs nonlocal (i.e., coupling) evolutions in the specific experimental setting. Relating these minimal times to the number of qubits gives the tightest known upper bounds to the actual time complexitymore » of the quantum modules. As will be shown, time complexity is a more realistic measure of the experimental cost than the usual gate complexity. In the limit of fast local controls (as, e.g., in NMR), time-optimized realizations are shown for the quantum Fourier transform (QFT) and the multiply controlled NOT gate (C{sup n-1}NOT) in various coupling topologies of n qubits. The speed-ups are substantial: in a chain of six qubits the quantum Fourier transform so far obtained by optimal control is more than eight times faster than the standard decomposition into controlled phase, Hadamard and SWAP gates, while the C{sup n-1}NOT gate for a completely coupled network of six qubits is nearly seven times faster.« less
  • We formulate and investigate the simplest version of time-optimal quantum computation theory (TO-QCT), where the computation time is defined by the physical one and the Hamiltonian contains only one- and two-qubit interactions. This version of TO-QCT is also considered as optimality by sub-Riemannian geodesic length. The work has two aims: One is to develop a TO-QCT itself based on a physically natural concept of time, and the other is to pursue the possibility of using TO-QCT as a tool to estimate the complexity in conventional gate-optimal quantum computation theory (GO-QCT). In particular, we investigate to what extent is true themore » following statement: Time complexity is polynomial in the number of qubits if and only if gate complexity is also. In the analysis, we relate TO-QCT and optimal control theory (OCT) through fidelity-optimal computation theory (FO-QCT); FO-QCT is equivalent to TO-QCT in the limit of unit optimal fidelity, while it is formally similar to OCT. We then develop an efficient numerical scheme for FO-QCT by modifying Krotov's method in OCT, which has a monotonic convergence property. We implemented the scheme and obtained solutions of FO-QCT and of TO-QCT for the quantum Fourier transform and a unitary operator that does not have an apparent symmetry. The former has a polynomial gate complexity and the latter is expected to have an exponential one which is based on the fact that a series of generic unitary operators has an exponential gate complexity. The time complexity for the former is found to be linear in the number of qubits, which is understood naturally by the existence of an upper bound. The time complexity for the latter is exponential in the number of qubits. Thus, both the targets seem to be examples satisfyng the preceding statement. The typical characteristics of the optimal Hamiltonians are symmetry under time reversal and constancy of one-qubit operation, which are mathematically shown to hold in fairly general situations.« less
  • Cited by 3
  • Two well-entrenched bus architectures, plus another that anticipates artificial intelligence, are leaving behind an IEEE-proposed bus. As commercial realities, the Vmebus and the multibus II have an edge over both the IEEE's proposed future bus and the 32-bit Nubus being jointly developed by the Massachusetts Institute of Technology (Cambridge) and Texas Instruments Inc. (Houston).