Optimum ratio between two bases in Bennett-Brassard 1984 protocol with second order analysis

• URL: http://arxiv.org/abs/2201.11960v1
• Date: Fri, 28 Jan 2022 07:05:51 GMT
• Title: Optimum ratio between two bases in Bennett-Brassard 1984 protocol with second order analysis
• Abstract summary: We use the second order expansion for the length of the generation keys under the coherent attack. Surprisingly, the second order has the order $n3/4$, which is much larger than the second order $n1/2$ in the conventional setting.
• Score: 61.12008553173672
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Bennet-Brassard 1984 (BB84) protocol, we optimize the ratio of the choice of two bases, the bit basis and the phase basis by using the second order expansion for the length of the generation keys under the coherent attack. This optimization addresses the trade-off between the loss of transmitted bits due to the disagreement of their bases and the estimation error of the error rate in the phase basis. Then, we derive the optimum ratio and the optimum length of the generation keys with the second order asymptotics. Surprisingly, the second order has the order $n^{3/4}$, which is much larger than the second order $n^{1/2}$ in the conventional setting when $n$ is the number of quantum communication. This fact shows that our setting has much larger importance for the second order analysis than the conventional problem. To illustrate this importance, we numerically plot the effect of the second order correction.

Related papers

• Optimizer Memory Makes Shuffle Order a First-Order Source of Fine-Tuning Noise [0.0]
  Shuffle order can be a larger source of fine-tuning noise than a memoryless analysis predicts.<n>We isolate this mechanism and derive a fit-free way to size the noise it produces.
  arXiv  Detail & Related papers  (2026-06-28T18:44:08Z)
• Adaptive Regularization for Sparsity Control in Bregman-Based Optimizers [14.98763942493771]
  We propose an adaptive regularization scheme that updates $$ based on the difference between the model's current sparsity and the target sparsity.<n>The proposed method reliably achieves sparsity targets ranging between 75% and 99%.<n>It also converges faster than the oracle-tuned non-adaptive baseline during early training and matches or surpasses its final performance in equal error rate.
  arXiv  Detail & Related papers  (2026-05-08T15:37:24Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• BPDQ: Bit-Plane Decomposition Quantization on a Variable Grid for Large Language Models [56.504879072674015]
  We propose Bit-Plane Decomposition Quantization (BPDQ), which constructs a variable quantization grid via bit-planes and scalar coefficients.<n>BPDQ enables serving Qwen2.5-72B on a single GTX 3090 with 83.85% GSM8K accuracy (vs. 90.83% at 16-bit)
  arXiv  Detail & Related papers  (2026-02-04T02:54:37Z)
• A Comparison of Quadratic and Higher-Order Representations for QAOA [0.0]
  We consider a routing problem and compare quadratic and higher-order representations using the Quantum Approximate optimisation algorithm (QAOA)<n>We find that the higher-order form yields better solution quality and scales better in terms of numbers of qubits, but requires more two-qubit gates.
  arXiv  Detail & Related papers  (2025-09-24T13:53:50Z)
• Speedup of high-order unconstrained binary optimization using quantum Z2 lattice gauge theory [2.2131426229426405]
  We present an approach by mapping the high-order unconstrained binary optimization to quantum Z2 lattice gauge theory. We achieve algorithmic speedup by using gauge symmetry.
  arXiv  Detail & Related papers  (2024-06-10T01:37:18Z)
• 4-bit Shampoo for Memory-Efficient Network Training [69.08646370812065]
  Second-order computation is superior to first-order computation in theory and practice. compressing 32-bit states to lower bitwidths has shown promise in reducing memory usage. We propose the first 4-bit second-order, exemplified by 4-bit Shampoo, maintaining performance similar to that of 32-bit ones.
  arXiv  Detail & Related papers  (2024-05-28T13:02:56Z)
• Improved Communication-Privacy Trade-offs in $L_2$ Mean Estimation under Streaming Differential Privacy [47.997934291881414]
  Existing mean estimation schemes are usually optimized for $L_infty$ geometry and rely on random rotation or Kashin's representation to adapt to $L$ geometry. We introduce a novel privacy accounting method for the sparsified Gaussian mechanism that incorporates the randomness inherent in sparsification into the DP. Unlike previous approaches, our accounting algorithm directly operates in $L$ geometry, yielding MSEs that fast converge to those of the Gaussian mechanism.
  arXiv  Detail & Related papers  (2024-05-02T03:48:47Z)
• Optimal Second-Order Rates for Quantum Information Decoupling [14.932939960009605]
  We consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. We find an achievability bound in entanglement distillation protocol, where the objective is for Alice and Bob to transform their quantum state to maximally entangled state with largest possible dimension.
  arXiv  Detail & Related papers  (2024-03-21T12:06:30Z)
• FOSI: Hybrid First and Second Order Optimization [11.447526245792154]
  We present FOSI, a novel metaalgorithm that improves the performance of any base first-order by efficiently incorporating second-order information during the optimization process. Our empirical evaluation demonstrates that FOSI improves the convergence rate and optimization time of first-order methods such as Heavy-Ball and Adam, and outperforms second-order methods (K-FAC and L-BFGS)
  arXiv  Detail & Related papers  (2023-02-16T18:45:46Z)
• Normalized/Clipped SGD with Perturbation for Differentially Private Non-Convex Optimization [94.06564567766475]
  DP-SGD and DP-NSGD mitigate the risk of large models memorizing sensitive training data. We show that these two algorithms achieve similar best accuracy while DP-NSGD is comparatively easier to tune than DP-SGD.
  arXiv  Detail & Related papers  (2022-06-27T03:45:02Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Towards an Understanding of Benign Overfitting in Neural Networks [104.2956323934544]
  Modern machine learning models often employ a huge number of parameters and are typically optimized to have zero training loss. We examine how these benign overfitting phenomena occur in a two-layer neural network setting. We show that it is possible for the two-layer ReLU network interpolator to achieve a near minimax-optimal learning rate.
  arXiv  Detail & Related papers  (2021-06-06T19:08:53Z)
• A Bop and Beyond: A Second Order Optimizer for Binarized Neural Networks [0.0]
  optimization of Binary Neural Networks (BNNs) relies on approximating the real-valued weights with their binarized representations. In this paper, we take an approach parallel to Adam which also uses the second raw moment estimate to normalize the first raw moment before doing the comparison with the threshold. We present two versions of the proposed: a biased one and a bias-corrected one, each with its own applications.
  arXiv  Detail & Related papers  (2021-04-11T22:20:09Z)
• Hessian-based optimization of constrained quantum control [0.0]
  gradient-based textscgrape algorithm is successfully applied in a wide range of different branches of quantum physics. We derive and implement exact $2mathrmnd$ order analytical derivatives of the coherent dynamics. We demonstrate performance improvements for both the best and average errors of constrained unitary gate synthesis on a circuit-textscqed system.
  arXiv  Detail & Related papers  (2020-06-01T13:31:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.