Hybrid approach for solving real-world bin packing problem … – Nature.com
In this section, we describe in detail the mathematical formulation of the 3 dBPP variant tackled in this research. First, input parameters and variables that compose the problem are shown inTable1.
The 3 dBPP can be solved as an optimization problem where a suitable cost function to minimize must be defined. In our case, this cost function is represented as the sum of three objectives. The strength given to each objective, i.e. the relevance accounted for each one, is up to the user preferences just by multiplying each objective with a suitable weight. Thus, the problem can be stated as (min text { }sum _{i=1}^3omega _io_i) with (omega _i) the weights of each objective (o_i). In our study, we will not consider this bias, i.e. (omega _i=1text { }forall i).
The first and main objective minimizes the total amount of bins used to locate the packages. This can be achieved by minimizing
$$begin{aligned} o_1 = sum _{j=1}^nv_j. end{aligned}$$
(1)
Additionally, for ensuring that items are packed from the floor to the top of the bin, avoiding solutions with floating packages, a second objective is defined by minimizing the average height of the items for all bins
$$begin{aligned} o_2 = frac{1}{mH}sum _{i=1}^mleft( z_i + z'_iright) . end{aligned}$$
(2)
Besides these two objectives reformulated from the reference code28, we further add a third optional objective (o_3) to take into account the load balancing feature. This concern is particularly important when air cargo planes and sailings are the chosen conveyance30,31, for example. In those situations, packages should be uniformly distributed around a given xy-coordinate inside the bin. We can tackle this by computing the so-called taxicab or Manhattan distance between items and the desired center of mass for each bin. As a result, the gaps between items are also reduced. Concerning this, the third objective to be minimized is
$$begin{aligned} o_3 = frac{1}{m}left( frac{1}{L}sum _{i=1}^m {tilde{x}}_i + frac{1}{W}sum _{i=1}^m {tilde{y}}_iright) , end{aligned}$$
(3)
with
$$begin{aligned} {tilde{x}}_i {:}{=}left| left( x_i + frac{x_i'}{2}right) !text { mod } L -{tilde{L}} right| quad text {and}quad {tilde{y}}_i {:}{=}left| y_i + frac{y_i'}{2} -{tilde{W}} right| quad forall iin I, end{aligned}$$
(4)
where (0le x_i< nL) (bins stacked horizontally) and (0le y_i< W) (forall iin I). This objective term minimizes for each item the distance between the center of mass projection in the xy-plane and the (({tilde{L}},{tilde{W}})) coordinate of each bin.
The objectives above defined are subject to certain restrictions, which are essential to derive realistic solutions. The whole pool of constraints is separated into two categories: the ones intrinsic to the BPP definition (intrinsic restrictions), and the ones relevant from a real-world perspective (real-world BPP restrictions).
Item orientations: the fact that inside a bin each item must have only one orientation can be implemented by using
$$begin{aligned} sum _{kin K_i}r_{i,k}=1quad forall iin I. end{aligned}$$
(5)
Set of possible orientations (kin K_i) for a given item i of dimensions ((l_i,w_i,h_i)). (a) (k = 1), (b) (k = 2), (c) (k = 3), (d) (k = 4), (e) (k = 5), (f) (k = 6). SeeTable2.
Orientations give rise to the effective length, width, and height of the items along x, y and z axes
$$begin{aligned} x'_i&= l_ir_{i,1} + l_ir_{i,2} + w_ir_{i,3} + w_ir_{i,4} + h_ir_{i,5} + h_ir_{i,6} quad forall iin I, end{aligned}$$
(6)
$$begin{aligned} y'_i&= w_ir_{i,1} + h_ir_{i,2} + l_ir_{i,3} + h_ir_{i,4} + l_ir_{i,5} + w_ir_{i,6} quad forall iin I, end{aligned}$$
(7)
$$begin{aligned} z'_i&= h_ir_{i,1} + w_ir_{i,2} + h_ir_{i,3} + l_ir_{i,4} + w_ir_{i,5} + l_ir_{i,6} quad forall iin I, end{aligned}$$
(8)
and because of (5), only one term (r_{i,k}) is nonzero in each equation.
It should be deemed that there could be items with geometrical symmetries, as with cubic ones where rotations do not apply. Redundant and non-redundant orientations are considered in the reference code28. In our formulation, we previously check if these symmetries exist to define (K_i) for each item. Thanks to this, (6)(8) are simplified filtering out redundant orientations and leading to a formulation which uses less variables (thus qubits) to represent the same problem, where (kappa =sum _{i=1}^m|K_i|le 6m) variables (r_{i,k}) are needed. For (iin I_text {c}) with (I_text {c}{:}{=}{iin I,|,l_i=w_i=h_i}) (cubic items), we can set (r_{i,1}=1) and 0 otherwise, thus satisfying(5) in advance. InTable2, we can see the non-redundant orientation sets for an item i depending on its dimensions. This simple mechanism reduces the complexity of the problem, being favourable for the quantum hardware to implement.
Non-overlapping restrictions: since we are considering rigid packages, i.e. they can not overlap, a set of restrictions need to be defined to overcome these configurations. For this purpose, at least one of these situations must occur (seeFig.2)
$$begin{aligned} text {Item }itext { is at the left of item }k, (q=1)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,1})nL+x_i+x'_i-x_kle 0{} & {} forall i,kin I,text { }forall jin J, end{aligned}$$
(9)
$$begin{aligned} text {Item }itext { is behind item }k, (q=2)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,2})W+y_i+y'_i-y_kle 0{} & {} forall i,kin I,text { }forall jin J, end{aligned}$$
(10)
$$begin{aligned} text {Item }itext { is below item }k, (q=3)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,3})H+z_i+z'_i-z_kle 0{} & {} forall i,kin I,text { }forall jin J, end{aligned}$$
(11)
$$begin{aligned} text {Item }itext { is at the right of item }k, (q=4)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,4})nL+x_k+x'_k-x_ile 0{} & {} forall i,kin I,text { }forall jin J,end{aligned}$$
(12)
$$begin{aligned} text {Item }itext { is in front of item }k, (q=5)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,5})W+y_k+y'_k-y_ile 0{} & {} forall i,kin I,text { }forall jin J, end{aligned}$$
(13)
$$begin{aligned} text {Item }itext { is above item }k, (q=6)text {:}{} & {} -(2 - u_{i,j}u_{k,j}-b_{i,k,6})H+z_k+z'_k-z_ile 0{} & {} forall i,kin I,text { }forall jin J. end{aligned}$$
(14)
As discussed with the orientation variable (r_{i,k}) in(5), the relative position between items i and k must be unique, so
$$begin{aligned} sum _{qin Q}b_{i,k,q}=1quad forall i,kin I. end{aligned}$$
(15)
Representation of (b_{i,k,q}) activated for all relative positions (qin Q) between items i and k. See(9)(14). Both are in contact but it is not mandatory. (a) (b_{{i},{k},1}=1), (b) (b_{{i},{k},2}=1), (c) (b_{{i},{k},3}=1), (d) (b_{{i},{k},4}=1), (e) (b_{{i},{k},5}=1), (f) (b_{{i},{k},6}=1).
Item and container allocation restrictions: the following set of restrictions guarantees an appropriate behaviour during item and bin assignment. In order to avoid packing duplicates of the same item, each item must go to exactly one bin, where
$$begin{aligned} sum _{j=1}^n u_{i,j}=1quad forall iin I. end{aligned}$$
(16)
The following formula verifies if items are being packed inside bins that are already in use
$$begin{aligned} sum _{i=1}^m(1-v_j)u_{i,j}le 0quad forall jin J, end{aligned}$$
(17)
so it activates (v_j) if needed during packaging. Bins can be activated sequentially to avoid duplicated solutions ensuring that
$$begin{aligned} v_jge v_{j+1}quad forall jin Jtext { } | text { }jne n. end{aligned}$$
(18)
Bin boundary constraints: in order to contemplate bin boundaries, the following set of restrictions must be met
$$begin{aligned}{} & {} x_i+x'_i-jL le (1-u_{i,j})nL quad forall iin I,text { }forall jin J, end{aligned}$$
(19)
$$begin{aligned}{} & {} x_i-(j-1)Lu_{i,j} ge 0 quad forall iin I,text { }forall jin Jtext { }|text { }j>1, end{aligned}$$
(20)
$$begin{aligned}{} & {} y_i+y'_i-W le (1-u_{i,j})W quad forall iin I,text { }forall jin J, end{aligned}$$
(21)
$$begin{aligned}{} & {} z_i+z'_i-H le (1-u_{i,j})H quad forall iin I,text { }forall jin J, end{aligned}$$
(22)
where(19) guarantees that items i placed inside the bin j are not outside of the last bin (n-th bin) along the x axis, (20) ensures that item i is located inside of its corresponding bin j along the x axis (activated if (n>1)), (21) confirms that item i placed inside the bin j is not outside along the y axis, while(22) ensures that item i allocated inside the bin j is not outside along the z axis.
In this subsection we introduce those restrictions related with the operative perspective of the problem, i.e. the ones that consider real-world industrial situations. All of the following constraints are optional in our formulation.
Overweight restriction: the weight of each package and the maximum capacity of containers are common contextual data to avoid exceeding the maximum weight capacity of bins, so avoid overloaded containers. We can introduce this restriction as
$$begin{aligned} sum _{i=1}^mmu _iu_{i,j}le Mquad forall jin J. end{aligned}$$
(23)
This restriction is activated if the maximum capacity M is given.
Affinities among package categories: there are commonly preferences for separating some packages into different bins (negative affinities or incompatibilities) or, on the contrary, gathering them into the same container (positive affinities). Let us consider (I_alpha {:}{=}{iin Itext { }|text { }{} texttt {id}text { of }itext { is equal to }alpha }), i.e. (I_alpha subset I) is a subset of all items labelled with id equal to (alpha). Given a set of p negative affinities (A^text {neg}{:}{=}{(alpha _1,beta _1),dots ,(alpha _p,beta _p)}), then the restriction will be
$$begin{aligned} sum _{(alpha ,beta )in A^text {neg}},sum _{(i_alpha ,i_beta )in I_alpha times I_beta },sum _{j=1}^nu_{i_alpha ,j}u_{i_beta ,j}=0, end{aligned}$$
(24)
To activate this restriction, a set of incompatibilities must be given. Moreover, we can satisfy in advance (nu {:}{=}6nsum _{(alpha ,beta )in A^text {neg}}|I_alpha ||I_beta |) non-overlapping constraints (see(9)(14)), leading to a simpler formulation. Conversely, given a set of positive affinities (A^text {pos}) as stated with (A^text {neg}), then the restriction will be posed such that
$$begin{aligned} sum _{(alpha ,beta )in A^text {pos}},sum _{(i_alpha ,i_beta )in I_alpha times I_beta },sum _{j=1}^nleft( 1-u_{i_alpha ,j}u_{i_beta ,j}right) =0, end{aligned}$$
(25)
This restriction is activated if a set of positive affinities is given. If (A^text {pos}) and (A^text {neg}) are given, then both restrictions can be introduced using just one formula adding(24) and (25).
Preferences in relative positioning: relative positioning of items demands that some of them must be placed in a specific position with respect other existing items. This preference allows introducing the ordering of a set of packages according to their positions with respect to the axes. Thus, this preference assists in ordering for many real cases such as: parcel delivery (an item i that has to be delivered before item k will be preferably placed closer to the trunk door) or load bearing (no heavy package should rest over flimsy packages), among others.
Regarding this preference, we can define two different perspectives to treat relative positioning:
Positioning to avoid ((P_q^{-})): list of items (i,k) should not be in the relative position (qin Q) specified. So, (b_{i,k,q}=0) is expected, favouring configurations where the solver selects (q'in Q) with (q'ne q) for the relative positioning of items (i,k).
Positioning to favour ((P_q^{+})): list of items (i,k) should be in a certain relative position q. Activated this preference, (b_{i,k,q}=1) ought to hold and consequently, (b_{i,k,q'}=0 forall q'ne q).
Formally, these preferences are written as
$$begin{aligned} P_q^{-}{:}{=}{(i,k)in I^2text { }|text { }i
(26)
These preferences could be also treated as compulsory pre-selections. In such case, the number of variables needed would be reduced, so would the search space. If we let (smash [t]{p^{-}=sum _{qin Q}|P_q^{-}|}) and (smash [t]{p^{+}=sum _{qin Q}|P_q^{+}|}) with (smash [t]{P^{-}_qcap P^{+}_{q'}=varnothing }), based on(15), the amount of variables reduced would be given by (smash [t]{p^{-}+6p^{+}}). Moreover, (smash [t]{n(p^{-}+5p^{+})}) non-overlapping constraints (see(9)(14)) are satisfied directly and can be ignored, thus simplifying the problem. In this paper, for the sake of clarity, these preferences have been applied for load bearing purposes as hard constraints (HC), as explained in the upcoming Experimental results.
Load balancing: to activate this restriction, a target center of mass must be given. Global positions with respect to the bin as a whole (as described in objective (o_3) in(3)), are fixed using the following constraints
$$begin{aligned} pm frac{1}{n}sum _{j=1}^nleft[ x_i+frac{x_i'}{2} - n(j-1)u_{i,j}L -{tilde{L}}right] le {tilde{x}}_i quad text {and}quad pm left( y_i+frac{y_i'}{2} -{tilde{W}}right) le {tilde{y}}_i quad forall iin I. end{aligned}$$
(27)
This feature is represented inFig.3 for (({tilde{L}},{tilde{W}})=(L/2,W/2)), whose red line shows the available ({tilde{x}}_i) and ({tilde{y}}_i) values (see(4)).
Representation of available ({tilde{x}}_i) and ({tilde{y}}_i) values ensured by the constraints given in(27) for (({tilde{L}},{tilde{W}}) = (L/2,W/2)).
Regarding the complexity of the 3 dBPP proposed in this research, the total amount of variables needed to tackle an arbitrary instance is given inTable3, where our formulation scales as ({mathscr {O}}[m^2+nm]) in terms of variables. Additionally, the total amount of constraints required is provided inTable4, whose quantity grows quadratically as ({mathscr {O}}[m^2+nm]).
Go here to read the rest:
Hybrid approach for solving real-world bin packing problem ... - Nature.com
- Buy D-Wave Quantum Stock, Analyst Says. Its a Compelling Investment Opportunity. - Barron's - July 24th, 2025 [July 24th, 2025]
- Pacific Northwest tech pioneers team up in quantum realms and on the space frontier - GeekWire - July 24th, 2025 [July 24th, 2025]
- Quantum Computing Inc. (QUBT): A Bear Case Theory - MSN - July 24th, 2025 [July 24th, 2025]
- Can Unisys Capitalize Early With Looming Quantum Threats? - TradingView - July 24th, 2025 [July 24th, 2025]
- Quantum Beach 2025 to Spotlight Floridas Role in the Global Quantum Economy - The Quantum Insider - July 24th, 2025 [July 24th, 2025]
- EXPLAINER - What is quantum computing, and why does it matter? - AnewZ - July 24th, 2025 [July 24th, 2025]
- D-Wave or IonQ: Which Quantum Stock Has More Upside in 2025? - Yahoo Finance - July 24th, 2025 [July 24th, 2025]
- Infleqtion to Build Neutral Atom Quantum Computer in Illinois, Backed by $50 Million Partnership - The Quantum Insider - July 24th, 2025 [July 24th, 2025]
- The worlds most powerful quantum computer is coming to Denmark - Evertiq - July 24th, 2025 [July 24th, 2025]
- Microsoft and Atom Computing to build "worlds most powerful quantum computer" in Denmark - Data Center Dynamics - July 24th, 2025 [July 24th, 2025]
- Billionaires Are Buying This Quantum Computing Stock Hand Over Fist (Hint: It's Not IonQ or D-Wave Quantum) - The Motley Fool - July 22nd, 2025 [July 22nd, 2025]
- Quantum Stocks Slide: Is the Hype-Fueled Rally Over? - 24/7 Wall St. - July 22nd, 2025 [July 22nd, 2025]
- Apply to host an event at Qiskit Fall Fest 2025! - IBM - July 22nd, 2025 [July 22nd, 2025]
- 'NSF was there at the start' an experimental quantum chip may yield more robust qubits - National Science Foundation (.gov) - July 22nd, 2025 [July 22nd, 2025]
- Want to Invest in Quantum Computing? 4 Stocks That Are Great Buys Right Now - The Motley Fool - July 22nd, 2025 [July 22nd, 2025]
- Will IonQ's Hardware Push Drive the Next Wave of Quantum Monetization? - TradingView - July 22nd, 2025 [July 22nd, 2025]
- Billionaires Are Buying This Quantum Computing Stock Hand Over Fist (Hint: It's Not IonQ or D-Wave Quantum) - AOL.com - July 22nd, 2025 [July 22nd, 2025]
- JPMorgan Overhauls Quantum Team, Rehires Former Exec - IoT World Today - July 22nd, 2025 [July 22nd, 2025]
- 54-qubit superconducting quantum processor from IQM now avaialable on Amazon Braket - Scientific Computing World - July 22nd, 2025 [July 22nd, 2025]
- 2 Top Quantum Computing Stocks to Buy in July - MSN - July 22nd, 2025 [July 22nd, 2025]
- New trapped-atom qubit technology translates to industry-ready quantum computing product - College of Engineering | University of Wisconsin-Madison - July 22nd, 2025 [July 22nd, 2025]
- D-Wave Quantum (QBTS) Capitalizes on Annealing Advantage to Extend Bullish Outlook - TipRanks - July 22nd, 2025 [July 22nd, 2025]
- Google Research Award Calls For Scientists to Probe Quantum Effects in The Brain - The Quantum Insider - July 22nd, 2025 [July 22nd, 2025]
- Quantum Computing Threatens Blockchains, Driving Development Of Resistant Systems - Quantum Zeitgeist - July 22nd, 2025 [July 22nd, 2025]
- Quantum Computing: What We Know Ahead Of Q2 (NASDAQ:QUBT) - Seeking Alpha - July 22nd, 2025 [July 22nd, 2025]
- SpinQ's Quantum Computing Breakthrough: 100-Qubit Machine by Year-End - News and Statistics - IndexBox - July 22nd, 2025 [July 22nd, 2025]
- QED-C holds second annual Quantum Technologies Showcase on Capitol Hill - Scientific Computing World - July 22nd, 2025 [July 22nd, 2025]
- The Quantum Bitcoin Summit: A Grounded Look At The Issues - Bitcoin Magazine - July 22nd, 2025 [July 22nd, 2025]
- Why Shares of Rigetti Computing Have Blasted 41% Higher This Week - The Motley Fool - July 22nd, 2025 [July 22nd, 2025]
- Quantum computing will soon crack todays encryption methods.Here are 3 ways businesses can prepare - The World Economic Forum - July 22nd, 2025 [July 22nd, 2025]
- 7M Bitcoin at Risk as Quantum Computing Set to Break Crypto in 3 Years | Interview - Cryptonews - July 22nd, 2025 [July 22nd, 2025]
- QED-C Holds Second Annual Quantum Technologies Showcase on Capitol Hill - The Quantum Insider - July 22nd, 2025 [July 22nd, 2025]
- PsiQuantums Chicago quantum computer to begin operations in 2028 - Bloomberg - Investing.com - July 22nd, 2025 [July 22nd, 2025]
- Chicagos $1 Billion Quantum Computer Set to Go Live in 2028 - Bloomberg.com - July 22nd, 2025 [July 22nd, 2025]
- Are We in a Quantum Computing Bubble? - MSN - July 20th, 2025 [July 20th, 2025]
- Quantum computing is so fire No, seriously. BofA says it could be humanity's biggest breakthrough since the discovery of fire - Fortune - July 20th, 2025 [July 20th, 2025]
- 2 Top Quantum Computing Stocks to Buy in July - The Motley Fool - July 20th, 2025 [July 20th, 2025]
- Bitcoin News: How Quantum Computing Threatens the Math Behind Satoshi Nakamoto's Creation - CoinDesk - July 20th, 2025 [July 20th, 2025]
- Should You Invest $1,000 in Quantum Computing Competitor Rigetti Computing? - The Motley Fool - July 20th, 2025 [July 20th, 2025]
- Google solves septillionyear problem This quantum chip is the end of computers - El Diario 24 - July 20th, 2025 [July 20th, 2025]
- Researchers Push for Open-Source Quantum Tools to Break Critical Industry Bottlenecks - The Quantum Insider - July 20th, 2025 [July 20th, 2025]
- Quantum Leap or Overpriced Hype? D-Wave's $400M Raise and the Future of Quantum Computing - AInvest - July 20th, 2025 [July 20th, 2025]
- Want to Invest in Quantum Computing Without the Crazy Risk? Buy These 3 Stocks. - The Globe and Mail - July 20th, 2025 [July 20th, 2025]
- Quantum computing edges closer to biotech reality in Moderna-IBM pact - R&D World - July 20th, 2025 [July 20th, 2025]
- Scientists achieve 'magic state' quantum computing breakthrough 20 years in the making quantum computers can never be truly useful without it -... - July 20th, 2025 [July 20th, 2025]
- Guest Post -- Practical Quantum Advantage in the Context of Quantum AI: Rise of the Hybrid Systems - The Quantum Insider - July 20th, 2025 [July 20th, 2025]
- Warren Buffett Is Invested in These Three Magnificent Quantum Computing Stocks. Here's the Best of the Bunch. - Yahoo Finance - July 20th, 2025 [July 20th, 2025]
- After Plummeting by 18%, Could This Quantum Computing Stock Stage a Second-Half Comeback? - The Motley Fool - July 20th, 2025 [July 20th, 2025]
- Scientists make 'magic state' breakthrough after 20 years without it, quantum computers can never be truly useful - Live Science - July 18th, 2025 [July 18th, 2025]
- D-Wave Quantum Skyrocketed Today. Is the Stock a Buy? - Yahoo Finance - July 18th, 2025 [July 18th, 2025]
- EIFO and the Novo Nordisk Foundation Acquire the Worlds Most Powerful Quantum Computer - Novo Nordisk Fonden - July 18th, 2025 [July 18th, 2025]
- Israel and US to forge $200m tech hub for AI and quantum science development - The Times of Israel - July 18th, 2025 [July 18th, 2025]
- Quantum code breaking? You'd get further with an 8-bit computer, an abacus, and a dog - theregister.com - July 18th, 2025 [July 18th, 2025]
- Is quantum computing the next big thing in stocks? - TheStreet - July 18th, 2025 [July 18th, 2025]
- What to do while pursuing the promise of quantum computing - Brookings - July 18th, 2025 [July 18th, 2025]
- Microsoft and Atom Computing Partner on Level 2 Quantum System for Nordic Users - The Quantum Insider - July 18th, 2025 [July 18th, 2025]
- Progress Toward Practical Areas of Quantum Technology - CSIS | Center for Strategic and International Studies - July 18th, 2025 [July 18th, 2025]
- Hybrid classical and quantum computing for enhanced glioma tumor classification using TCGA data - Nature - July 18th, 2025 [July 18th, 2025]
- Oxford Ionics And Iceberg Quantum Partner to Accelerate Fault-Tolerant Quantum Computing - The Quantum Insider - July 18th, 2025 [July 18th, 2025]
- Are We Truly Prepared for the Era of Quantum Computing? - Security Boulevard - July 18th, 2025 [July 18th, 2025]
- New quantum computer with great potential to boost Nordic research and innovation - Novo Nordisk Fonden - July 18th, 2025 [July 18th, 2025]
- Launching a Quantum Computer, Photonics Meets Electronics in a First-of-its-Kind Chip - Photonics Spectra - July 18th, 2025 [July 18th, 2025]
- Huge investment to build in Denmark the first level-2 quantum computer - The Copenhagen Post - July 18th, 2025 [July 18th, 2025]
- D-Wave Quantum Skyrocketed Today. Is the Stock a Buy? - The Motley Fool - July 18th, 2025 [July 18th, 2025]
- Oxford Ionics and Iceberg Quantum Partner to Design Fault-Tolerant Quantum Architecture - Quantum Computing Report - July 18th, 2025 [July 18th, 2025]
- Cornell And IBM Demonstrate Error-Resistant Quantum Computing Advance - Quantum Zeitgeist - July 18th, 2025 [July 18th, 2025]
- Quobly and Inria Partner to Advance Scalable, Sovereign Quantum Systems in France - Quantum Computing Report - July 18th, 2025 [July 18th, 2025]
- How IBM and Moderna (MRNA) Are Using Quantum Computing to Design Vaccines Faster - TipRanks - July 18th, 2025 [July 18th, 2025]
- Why D-Wave Quantum Stock Skyrocketed 74.3% in the First Half of 2025 -- and What Comes Next - The Motley Fool - July 18th, 2025 [July 18th, 2025]
- D-Wave Quantum Skyrocketed Today. Is the Stock a Buy? - Nasdaq - July 18th, 2025 [July 18th, 2025]
- IBM and Moderna Team Up on Quantum Study. What It Means for the World of Medicine. - Barron's - July 18th, 2025 [July 18th, 2025]
- Silicon Spin Qubits: Scaling Toward the Million-Qubit Era - EE Times Europe - July 18th, 2025 [July 18th, 2025]
- Why D-Wave Quantum Stock Skyrocketed 74.3% in the First Half of 2025 -- and What Comes Next - The Globe and Mail - July 18th, 2025 [July 18th, 2025]
- Universal Quantum and TUHH Partner on Scalable Quantum Software for 100 000-Qubit Machines - The Quantum Insider - July 16th, 2025 [July 16th, 2025]
- IonQ, D-Wave, and Rigetti Face Off Ahead of Earnings Whos Nearest to Commercial Breakthrough? - TipRanks - July 16th, 2025 [July 16th, 2025]
- Granite Geek: As quantum mechanics turns 100, it is sneaking into everyday life - Monadnock Ledger-Transcript - July 16th, 2025 [July 16th, 2025]
- The rise of women in quantum science in India and the legacy of Satyendra Nath Bose - Physics World - July 16th, 2025 [July 16th, 2025]
- BDx and Anyon launch hybrid quantum AI testbed in Singapore - Light Reading - July 16th, 2025 [July 16th, 2025]
- What Is RSA Encryption, And Did China Really Break It? - SlashGear - July 14th, 2025 [July 14th, 2025]
- D-Wave Quantum (QBTS) Loses 11.8% as 2 Tech Giants Could Threaten its Competitive Edge - MSN - July 14th, 2025 [July 14th, 2025]