The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here, we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag–Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation.
The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag-Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind, as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation.
We used a Digital Annealer (quantum-inspired) and a Transformer (AI) on a distributor's real orders to minimise container volume and the number of boxes, refined with a constraint-programming solver (CP-SAT) after the initial assignment. Counting containers before the items are placed turned out to be misleading: on a standard benchmark, assignments that only check volume claim 4.00 containers against 5.46 for first-fit decreasing (FFD), and 80–100% of them cannot be built, so a verifier proves that every answer here fits.With our refinement, the result is practically the same whatever builds the initial proposal (a classical heuristic, one package per box, the Transformer or the annealing pipeline): on 923 held-out orders, all ship about 6% less volume than the distributor's real shipments. The starting point changes the time; the Transformer's is fastest on mid-size orders. On the 20 largest held-out orders, four refinements in parallel, two of them with identical packages grouped in rows, double the saving (a version without the Transformer adds 2.3 points on 117 other large orders); rows work because the solver's subproblems become smaller.The final system ships 6.2% less volume than the distributor and, on our hardware, answers faster on nine orders in ten. The annealer, which cannot represent positions, was not the right tool here. We also release DIVERSE3DBPP-v1, a benchmark with a heterogeneous catalogue and a provable optimum; on the standard Martello–Pisinger–Vigo instances, with a single bin type, the refinement ends 4–6% above the best published metaheuristics.
Quantum Key Distribution (QKD) enables two parties to securely share encryption keys by leveraging the principles of quantum mechanics, offering protection against eavesdropping. In practical implementations, QKD systems often rely on a layered architecture where a key manager stores secret key material in a buffer and delivers it to higher communication layers as needed. However, this buffer can be depleted under high demand, requiring efficient replenishment strategies that minimize resource waste. Given the importance of optimizing time and resources in quantum cryptography protocols, we introduce a variable-length adaptation of the BB84 protocol designed to meet user-defined output key length constraints in non-ideal scenarios. We present a method for dynamically configuring the protocol's initial parameters to generate secret keys of a desired length. To validate our approach, we developed simulation tools to model general QKD networks and discrete-variable protocols. These tools were used to implement and evaluate our strategies, which were developed within the BB84 framework but can be extended to other QKD protocols under reasonable assumptions. The results highlight their usefulness in optimizing quantum resource usage and supporting key management, contributing to the long-term goal of scaling and strengthening secure quantum networks.
Quantum Key Distribution (QKD) enables two parties to securely share encryption keys by leveraging the principles of quantum mechanics, offering protection against eavesdropping. In practical implementations, QKD systems often rely on a layered architecture where a key manager stores secret key material in a buffer and delivers it to higher communication layers as needed. However, this buffer can be depleted under high demand, requiring efficient replenishment strategies that minimize resource waste. Given the importance of optimizing time and resources in quantum cryptography protocols, we introduce a variable-length adaptation of the BB84 protocol designed to meet user-defined output key length constraints in non-ideal scenarios. We present a method for dynamically configuring the protocol’s initial parameters to generate secret keys of a desired length. To validate our approach, we developed simulation tools to model general QKD networks and discrete-variable protocols. These tools were used to implement and evaluate our strategies, which were developed within the BB84 framework but can be extended to other QKD protocols under reasonable assumptions. The results highlight their usefulness in optimizing quantum resource usage and supporting key management, contributing to the long-term goal of scaling and strengthening secure quantum networks.
1 September 2026 in Computer Physics Communications